A translation of Problemy Peredachi Informatsii

previous Volume 33, Number 1, January–March, 1997 next
Back to contents page

CONTENTS                   Powered by MathJax

Combinatorial Entropy of Images   [View Abstract]
J. Justesen and Yu. M. Shtarkov
pp. 1–8

On the Asymptotic Capacity of a Multiple-Access Channel   [View Abstract]
L. Wilhelmsson and K. Sh. Zigangirov
pp. 9–16

Multialphabet Weighting Universal Coding of Context Tree Sources   [View Abstract]
Yu. M. Shtarkov, Tj. J. Tjalkens, and F. M. J. Willems
pp. 17–28

On One Finite Matrix Group and Codes on Euclidean Spheres   [View Abstract]
V. M. Sidelnikov
pp. 29–44

Codes for the $m$-Metric   [View Abstract]
M. Yu. Rosenbloom and M. A. Tsfasman
pp. 45–52

Code-Generating Factorizations of the $n$-Dimensional Unit Cube and of Perfect Binary Codes   [View Abstract]
Yu. L. Vasil'ev and F. I. Solov'eva
pp. 53–61

On the Propagation Criterion for Boolean Functions and on Bent Functions   [View Abstract]
V. V. Yashchenko
pp. 62–71

The Euler Characteristic of the Minimal Code Trellis is Maximum   [View Abstract]
V. R. Sidorenko
pp. 72–77

Asymptotically Efficient Signal Estimation in $L_2$ under General Loss Functions   [View Abstract]
A. B. Tsybakov
pp. 78–88

On Realizability in the Algebra of Unreliable Generalized Contacts   [View Abstract]
V. V. Tarasov
pp. 89–93