A translation of Problemy Peredachi Informatsii

previous Volume 46, Number 4, October–December, 2010 next
Back to contents page


BSC Reliability Function under List Decoding   [View Abstract]
V. M. Blinovsky
pp. 273–282

Transition Points in the Capacity-Achieving Distribution for the Peak-Power Limited AWGN and Free-Space Optical Intensity Channels   [View Abstract]
N. Sharma and S. Shamai (Shitz)
pp. 283–299

Decoding of Random Network Codes   [View Abstract]
E. M. Gabidulin, N. I. Pilipchuk, and M. Bossert
pp. 300–320

Special Sequences as Subcodes of Reed–Solomon Codes   [View Abstract]
A. A. Davydov, V. V. Zyablov, and R. E. Kalimullin
pp. 321–345

Complete and Incomplete Boolean Degrees   [View Abstract]
S. S. Marchenkov
pp. 346–352

Discrete Chrestenson Transform   [View Abstract]
M. S. Bespalov
pp. 353–375

On Enumeration of q-ary Sequences with a Fixed Number of Occurrences of the Subblock 00   [View Abstract]
V. S. Lebedev
pp. 376–381

On the Rate of Beta-Mixing and Convergence to a Stationary Distribution in Continuous-Time Erlang-Type Systems   [View Abstract]
A. Yu. Veretennikov
pp. 382–389

Fast Enumeration Algorithm for Words with Given Constraints on Run Lengths of Ones   [View Abstract]
Yu. S. Medvedeva and B. Ya. Ryabko
pp. 390–399

International Symposium on Information Theory (ISIT’2011). Call for Papers
pp. 400–401

pp. 402–405