A translation of Problemy Peredachi Informatsii

previous Volume 48, Number 4, October–December, 2012 next
Back to contents page


Analysis of the Relation between Properties of LDPC Codes and the Tanner Graph   [View Abstract]
V. V. Zyablov and P. S. Rybin
pp. 297–323

Asymptotic Single-Trial Strategies for GMD Decoding with Arbitrary Error-Erasure Tradeoff   [View Abstract]
J. H. Weber, V. R. Sidorenko, C. Senger, and K. A. S. Abdel-Ghaffar
pp. 324–333

On Walsh Code Assignment   [View Abstract]
B. S. Tsybakov and A. B. Tsybakov
pp. 334–341

On One Asymptotic Formula for the Euler Constant   [View Abstract]
E. A. Karatsuba
pp. 342–346

A Remark on the Problem of Nonnegative k-Subset Sums   [View Abstract]
H. Aydinian and V. M. Blinovsky
pp. 347–351

Achievable Complexity-Performance Tradeoffs in Lossy Compression   [View Abstract]
A. Gupta, S. Verdú, and T. Weissman
pp. 352–375

Complexity-Compression Tradeoffs in Lossy Compression via Efficient Random Codebooks and Databases   [View Abstract]
C. Gioran and I. Kontoyiannis
pp. 376–394