1. Analysis of the relation between properties of LDPC codes and the tanner graph

   • V. V. Zyablov
   • P. S. Rybin

   Coding Theory 24 January 2013 Pages: 297 - 323

2. Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff

   • J. H. Weber
   • V. R. Sidorenko
   • K. A. S. Abdel-Ghaffar

   Coding Theory 24 January 2013 Pages: 324 - 333

3. On Walsh code assignment

   • B. S. Tsybakov
   • A. B. Tsybakov

   Coding Theory 24 January 2013 Pages: 334 - 341

4. On one asymptotic formula for the Euler constant

   • E. A. Karatsuba

   Large Systems 24 January 2013 Pages: 342 - 346

5. A remark on the problem of nonnegative k-subset sums

   • H. Aydinian
   • V. M. Blinovsky

   Large Systems 24 January 2013 Pages: 347 - 351

6. Achievable complexity-performance tradeoffs in lossy compression

   • A. Gupta
   • S. Verdú
   • T. Weissman

   Source Coding 24 January 2013 Pages: 352 - 375

7. Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

   • C. Gioran
   • I. Kontoyiannis

   Source Coding 24 January 2013 Pages: 376 - 394