1. Successive cancellation decoding of Reed-Solomon codes

   • P. V. Trifonov

   Coding Theory 07 January 2015 Pages: 303 - 312

2. Optimal almost equisymbol codes based on difference matrices

   • L. A. Bassalygo
   • V. A. Zinoviev

   Coding Theory 07 January 2015 Pages: 313 - 319

3. Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture

   • D. Bartoli
   • A. A. Davydov
   • F. Pambianco

   Coding Theory 07 January 2015 Pages: 320 - 339

4. Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

   • V. M. Blinovsky

   Large Systems 07 January 2015 Pages: 340 - 349

5. Interlacing and smoothing: Combinatorial aspects

   • M. L. Blank

   Large Systems 07 January 2015 Pages: 350 - 363

6. On the number of 1-factorizations of a complete graph

   • D. V. Zinoviev

   Large Systems 07 January 2015 Pages: 364 - 370

7. Gaussian Ornstein-Uhlenbeck and Bogoliubov processes: Asymptotics of small deviations for L ^p -functionals, 0 < p < ∞

   • V. R. Fatalov

   Large Systems 07 January 2015 Pages: 371 - 389

8. Universal coding for memoryless sources with countably infinite alphabets

   • B. D. Kudryashov
   • A. V. Porov

   Source Coding 07 January 2015 Pages: 390 - 399