A translation of Problemy Peredachi Informatsii

previous Volume 29, Number 2, April–June, 1993 next
Back to contents page


Universal Code Families   [View Abstract]
V. A. Zinoviev and G. L. Katsman
pp. 95–100

Spectrum Invariancy Under Output Approximation for Full-Rank Discrete Memoryless Channels   [View Abstract]
T. S. Han and S. Verdú
pp. 101–118

Distance Spectra of Lattice-Based Codes   [View Abstract]
A. N. Trofimov
pp. 119–131

New Bounds for the Minimum Length of Binary Linear Block Codes   [View Abstract]
S. M. Dodunekov, S. B. Encheva, and A. N. Ivanov
pp. 132–139

A New Version of the Creeper Algorithm   [View Abstract]
S. A. Popov
pp. 140–146

Branch and Bound Method for Design of Recurrent Signal Reception Algorithms   [View Abstract]
S. A. Belous and D. D. Klovsky
pp. 147–153

Empirical Spectral and Bispectral Analyses of Periodically Nonstationary Stochastic Processes   [View Abstract]
V. G. Alekseev
pp. 154–162

On a Random Process in the Multiple Access Problems   [View Abstract]
B. S. Tsybakov
pp. 163–175

Lower Bounds of Connectedness Probability for Some Classes of Random Graphs   [View Abstract]
V. P. Polessky
pp. 176–185

Algorithmic Approach to the Prediction Problem   [View Abstract]
B. Ya. Ryabko
pp. 186–193

Lower Bound on the Probability of Successful Substitution of Messages   [View Abstract]
L. A. Bassalygo
pp. 194–198

New Upper Bounds on Cardinality of Separating Systems   [View Abstract]
Yu. L. Sagalovich
pp. 199–202