1. BSC reliability function under list decoding

   • V. M. Blinovsky

   Information Theory 18 January 2011 Pages: 273 - 282

2. Transition points in the capacity-achieving distribution for the peak-power limited AWGN and free-space optical intensity channels

   • N. Sharma
   • S. Shamai (Shitz)

   Information Theory 18 January 2011 Pages: 283 - 299

3. Decoding of random network codes

   • E. M. Gabidulin
   • N. I. Pilipchuk
   • M. Bossert

   Coding Theory 18 January 2011 Pages: 300 - 320

4. Special sequences as subcodes of reed-solomon codes

   • A. A. Davydov
   • V. V. Zyablov
   • R. E. Kalimullin

   Coding Theory 18 January 2011 Pages: 321 - 345

5. Complete and incomplete Boolean degrees

   • S. S. Marchenkov

   Large Systems 18 January 2011 Pages: 346 - 352

6. Discrete Chrestenson transform

   • M. S. Bespalov

   Large Systems 18 January 2011 Pages: 353 - 375

7. On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00

   • V. S. Lebedev

   Large Systems 18 January 2011 Pages: 376 - 381

8. On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems

   • A. Yu. Veretennikov

   Communication Network Theory 18 January 2011 Pages: 382 - 389

9. Fast enumeration algorithm for words with given constraints on run lengths of ones

   • Yu. S. Medvedeva
   • B. Ya. Ryabko

   Source Coding 18 January 2011 Pages: 390 - 399

10. International symposium on information theory (ISIT’2011). Call for papers

    Chronicles 18 January 2011 Pages: 400 - 401