1. On the BSC reliability function: Expanding the region where it is known exactly

   • M. V. Burnashev

   Information Theory 05 January 2016 Pages: 307 - 325

2. Nonexistence of binary orthogonal arrays via their distance distributions

   • P. Boyvalenkov
   • H. Kulina
   • M. Stoyanova

   Coding Theory 05 January 2016 Pages: 326 - 334

3. Estimation of matrices with row sparsity

   • O. Klopp
   • A. B. Tsybakov

   Methods of Signal Processing 05 January 2016 Pages: 335 - 348

4. On regular realizability problems for context-free languages

   • M. N. Vyalyi
   • A. A. Rubtsov

   Large Systems 05 January 2016 Pages: 349 - 360

5. The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots

   • H. Möller

   Large Systems 05 January 2016 Pages: 361 - 370

6. A new estimate for the number of edges in induced subgraphs of a special distance graph

   • Ph. A. Pushnyakov

   Large Systems 05 January 2016 Pages: 371 - 377

7. On One method for constructing a family of approximations of zeta constants by rational fractions

   • E. A. Karatsuba

   Large Systems 05 January 2016 Pages: 378 - 390

8. Interrelation of families of points of high order on the Edwards curve over a prime field

   • A. V. Bessalov
   • O. V. Tsygankova

   Information Protection 05 January 2016 Pages: 391 - 397

9. Analysis of properties of q-ary Reed–Muller error-correcting codes viewed as codes for copyright protection

   • V. M. Deundyak
   • S. A. Yevpak
   • V. V. Mkrtichyan

   Information Protection 05 January 2016 Pages: 398 - 408