A translation of Problemy Peredachi Informatsii

previous Volume 27, Number 4, October–December, 1991 next
Back to contents page


Simple Methods for Deriving Lower Bounds in Coding Theory   [View Abstract]
L. A. Bassalygo, S. I. Gelfand, and M. S. Pinsker
pp. 277–281

Relative-Redundancy Universal Coding of Memoryless Sources   [View Abstract]
Yu. M. Shtarkov
pp. 282–288

Lower Bound on Error Probability in Fixed-Volume List Decoding   [View Abstract]
V. M. Blinovskii
pp. 288–302

Concatenation Method for Construction of Spherical Codes in n-Dimensional Euclidean Space   [View Abstract]
S. M. Dodunekov, V. A. Zinoviev, and Th. Ericson
pp. 303–307

Fast Maximum-Likelihood Decoding of Reed–Muller Codes   [View Abstract]
V. V. Zyablov and S. L. Portnoi
pp. 307–317

Decoding of Low-Density Codes   [View Abstract]
S. I. Kovalev
pp. 317–321

On Some Interpolation Procedures for a Partially Observed Markov Process   [View Abstract]
B. V. Lazareva
pp. 322–333

Nonstationarity Criterion for a Gaussian Time-Series Autoregressive Model with a Close Alternative   [View Abstract]
J. Kormos and V. I. Piterbarg
pp. 334–338

Fast Evaluation of Transcendental Functions   [View Abstract]
E. A. Karatsuba
pp. 339–360

Asymptotic Behavior of Nonanticipative Epsilon-Entropy for Gaussian Processes   [View Abstract]
A. K. Gorbunov and M. S. Pinsker
pp. 361–365

Distortion-free Compression of Telephone Signals in Multichannel Communication Lines   [View Abstract]
V. R. Zvonkovich, I. V. Pertsev, B. Ya. Ryabko, and I. V. Sitnyakovskii
pp. 366–369

pp. 371–377