A translation of Problemy Peredachi Informatsii

previous Volume 33, Number 3, July–September, 1997 next
Back to contents page

CONTENTS                   Powered by MathJax

A Fast Method for Full Randomization of Messages   [View Abstract]
B. Ya. Ryabko and A. N. Fionov
pp. 191–201

Construction of Perfect Binary Codes by Sequential Shifts of $\alpha$-Components   [View Abstract]
S. V. Avgustinovich and F. I. Solov'eva
pp. 202–207

A Metric for Codes over Residue Class Rings   [View Abstract]
I. Constantinescu and W. Heise
pp. 208–213

Decoding of Codes on an Elliptic Curve with Number of Errors Greater than Half the Designed Code Distance   [View Abstract]
A. Yu. Serebryakov
pp. 214–223

Information Processing in the Class of Functions with Finite Spectrum   [View Abstract]
Yu. G. Bulychev and I. V. Burlai
pp. 224–232

Clutter Untyings, Correlation Inequalities, and Bounds for Combinatorial Reliability   [View Abstract]
V. P. Polesskii
pp. 233–250

On the Matrix Apparatus for Elementary Markov Fields   [View Abstract]
V. N. Koshelev and S. I. Stasevich
pp. 251–267

Queueing Networks with Several Demand Types, Immediate Service, and Node Bypassing by Demands   [View Abstract]
A. V. Krylenko
pp. 268–276

Generalized Ideal Secret-Sharing Schemes and Matroids   [View Abstract]
G. R. Blakley and G. A. Kabatianski
pp. 277–284

On the Development of Fundamental Research on Informational Interaction in Nature and Society
Academician N. A. Kuznetsov
pp. 285–286