A translation of Problemy Peredachi Informatsii

previous Volume 40, Number 1, January–March, 2004 next
Back to contents page

CONTENTS                   Powered by MathJax

Mark Semenovich Pinsker. In Memoriam
pp. 1–4

On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes   [View Abstract]
D. S. Krotov and V. N. Potapov
pp. 5–12

New Minimum Distance Bounds for Linear Codes over $\operatorname{\it GF}(9)$   [View Abstract]
R. Daskalov, E. Metodieva, and P. Hristov
pp. 13–24

Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction   [View Abstract]
V. A. Zinoviev and D. V. Zinoviev
pp. 25–36

Construction of Perfect $q$-ary Codes by Sequential Switchings of $\widetilde{\alpha}$-Components   [View Abstract]
A. V. Los'
pp. 37–43

On Optimal Detectors in Multiuser Detection Problems   [View Abstract]
M. V. Burnashev
pp. 44–52

The Method of Risk Envelope in Estimation of Linear Functionals   [View Abstract]
G. K. Golubev
pp. 53–65

“Book Stack” as a New Statistical Test for Random Numbers   [View Abstract]
B. Ya. Ryabko and A. I. Pestunov
pp. 66–71

On Indication of External Factors by Circuits of Functional Elements   [View Abstract]
V. V. Tarasov
pp. 72–77

Local Diffusion Approximation of the State Changing Process of an Unstable Random Access Network in a Neighborhood of the Asymptotic Mean   [View Abstract]
P. I. Kotsyuruba and A. A. Nazarov
pp. 78–89

Optimal Universal Coding with Respect to the Maximal Individual Relative Redundancy Criterion   [View Abstract]
Yu. M. Shtarkov, Tj. J. Tjalkens, and F. M. J. Willems
pp. 90–101