Pages that link to "Item:Q174177"
From MaRDI portal
The following pages link to Problems of Information Transmission (Q174177):
Displaying 50 items.
- \(\epsilon\)-entropy of the Gibbs field (Q1097861) (← links)
- Epsilon-entropy with delay for small mean-square reproduction error (Q1097862) (← links)
- Correction of multiple errors by q-ary codes (Q1097863) (← links)
- A bound on the distance of unit memory generalized convolutional concatenated codes (Q1097864) (← links)
- General code shortening construction (Q1097865) (← links)
- Modulation/coding system for a Gaussian channel (Q1098817) (← links)
- Upper bound on the capacity of a random multiple-access system (Q1098818) (← links)
- Transmission accuracy of a continuous signal with binary quantization (Q1098819) (← links)
- Adaptive asymptotically minimax estimators of smooth signals (Q1098820) (← links)
- Algebro-geometric codes on curves of small genera (Q1098822) (← links)
- Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\). (Q1098823) (← links)
- Fast correlation decoding of Reed-Muller codes (Q1098825) (← links)
- Estimation of a linear functional from indirect observations (Q1099562) (← links)
- Reconstruction of signals corrupted by pulse noise (Q1101408) (← links)
- Optimal detection of random-length signals (Q1101409) (← links)
- An exhaustion bound for algebraic-geometric ``modular'' codes (Q1101412) (← links)
- Characteristics of a RMA stack algorithm and its use in a local network (Q1109000) (← links)
- Block transmission of information in a summing multiple access channel with feedback (Q1109002) (← links)
- Encoding of Poisson streams with unknown or inaccurately known parameters (Q1109005) (← links)
- Spectra of algebro-geometric codes (Q1109010) (← links)
- Sequential decoding of linear convolutional codes (Q1109751) (← links)
- Greismer codes with maximum covering radius (Q1110485) (← links)
- Constructive distance of the best among the known (55,16,19) Goppa codes (Q1110486) (← links)
- Convergence and optimality of realizable adaptation algorithms (information-theory approach) (Q1111292) (← links)
- Extremal problems in minimax estimation of sequences (Q1111297) (← links)
- Spectral density estimates for some models of stationary stochastic processes (Q1111300) (← links)
- Median filtering of deterministic and stationary random signals (Q1112446) (← links)
- Universal sequential coding of single messages (Q1112787) (← links)
- Improved upper bound on the probability of decoding error for codes of complex structure (Q1112789) (← links)
- Optimal decoding of convolutional codes in channels with additive Markov noise (Q1112791) (← links)
- Linear regularity condition for vector random fields (Q1113191) (← links)
- Calculation of distribution of convolution of a Wiener process (Q1113214) (← links)
- Sequential estimation of parameters of diffusion processes (Q1113243) (← links)
- Sequential estimation of intensity of renewal processes (Q1113244) (← links)
- Estimating the spectral densities of a Gaussian periodically correlated process (Q1114259) (← links)
- Detection of signals with random moments of appearance and disappearance (Q1114274) (← links)
- Hybrid switching networks of an infinite one-dimensional lattice (Q1114580) (← links)
- Increasing the efficiency of numerical methods for models with repeat calls (Q1114583) (← links)
- Minimax filtering of signals from nonstationary filters (Q1115006) (← links)
- Stability analysis of a packet switching network and its application to the construction of a unified approach to synchronous and asynchronous ALOHA radio networks (Q1115338) (← links)
- Obituary: Andrej Nikolaevich Kolmogorov (Q1115407) (← links)
- Capacity parametrization of a multiple-access binary adder channel with shared information (Q1117197) (← links)
- \(\delta\)-decodable code constructions for a T-user adder channel (Q1117198) (← links)
- Prediction of random sequences and universal coding (Q1117199) (← links)
- An optimal ensemble of binary sequences based on the union of the ensembles of Kasami and bent-function sequences (Q1117200) (← links)
- Decoding of Berman modular MDS codes (Q1117201) (← links)
- Some Markov chain functions and associated non-symmetric random walks with absorbing barriers (Q1117588) (← links)
- Ergodicity, stability, and insensitivity for one class of circuit switching networks (Q1117603) (← links)
- Cycles in collectives of threshold automata (Q1118409) (← links)
- Sequential decoding in a channel with spelling errors (Q1118571) (← links)
