Information Theory and Coding Theory
|
|
Probabilistic Decoding of Nonbinary Majority Decodable Codes V. D. Kolesnik, S. L. Portnoi
|
3–17 |
|
Delayed Epsilon-Entropy for a Gaussian Message Corrupted by Noise A. K. Gorbunov, M. S. Pinsker
|
18–23 |
|
On Characterization and Existence Conditions of Codes Meeting the Varshamov–Griesmer Bound V. N. Logachev
|
24–41 |
|
Nonbinary Codes with Distances 4, 5, and 6 of Cardinality Greater than the BCH Codes I. I. Dumer
|
42–54 |
|
Methods of Signal Processing
|
|
Nonparametric Estimation of a Linear Functional of the Regression Function for a Given Observation Design Yu. I. Pastukhova, R. Z. Khas'minskii
|
55–65 |
|
Locally Asymptotic Minimax Estimation of One Functional of an Unknown Distribution M. B. Nevel'son, I. V. Shafranskii
|
66–82 |
|
Some Markov Chain Functions and Associated Nonsymmetric Random Walks with Absorbing Barriers V. D. Kolesnik, B. D. Kudryashov
|
83–93 |
|
Automata Theory and Communication-Network Theory
|
|
Computing Packet Delay for Some Random Multiple Access Stack Algorithms N. D. Vvedenskaya, B. S. Tsybakov
|
94–101 |
|
A Comment on the Paper of Kasami, Lin, Wei, and Yamamura, “Coding for the Binary Symmetric Broadcast Channel with Two Receivers” L. A. Bassalygo, M. S. Pinsker
|
102–106 |
|
On a Model of Associative Memory V. V. Rykov, A. G. D'yachkov
|
107–110 |
|
Chronicle
|
|
XV All-Union Workshop on Information Theory and Applications
|
111 |