1. On convergence properties of Shannon entropy

   • F. J. Piera
   • P. Parada

   Information Theory 18 July 2009 Pages: 75 - 94

2. Low-complexity error correction of Hamming-code-based LDPC codes

   • V. A. Zyablov
   • R. Johannesson
   • M. Lončar

   Coding Theory 18 July 2009 Pages: 95 - 109

3. A method for proving nonexistence of spherical designs of odd strength and odd cardinality

   • S. Boumova
   • P. Boyvalenkov
   • M. Stoyanova

   Coding Theory 18 July 2009 Pages: 110 - 123

4. DNA codes for additive stem similarity

   • A. G. D’yachkov
   • A. N. Voronina

   Coding Theory 18 July 2009 Pages: 124 - 144

5. On weak isometries of Preparata codes

   • I. Yu. Mogil’nykh

   Coding Theory 18 July 2009 Pages: 145 - 150

6. Local and interweight spectra of completely regular codes and of perfect colorings

   • A. Yu. Vasil’eva

   Coding Theory 18 July 2009 Pages: 151 - 157

7. Exact formulas for computation of reception characteristics of a signal with unknown appearance and disappearance times

   • A. P. Trifonov
   • Yu. E. Korchagin

   Methods of Signal Processing 18 July 2009 Pages: 158 - 167

8. On complete one-way functions

   • A. A. Kozhevnikov
   • S. I. Nikolenko

   Large Systems 18 July 2009 Pages: 168 - 183

9. Asymptotically optimal perfect steganographic systems

   • B. Ya. Ryabko
   • D. B. Ryabko

   Information Protection 18 July 2009 Pages: 184 - 190

10. Remark on “On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions” published in Probl. Peredachi Inf., 2007, no. 4

    • V. V. Prelov
    • E. C. van der Meulen

    Letters to the Editor 18 July 2009 Pages: 191 - 191