1. Degradable channels, less noisy channels, and quantum statistical morphisms: An equivalence relation

   • F. Buscemi

   Information Theory 19 October 2016 Pages: 201 - 213

2. Classical capacities of quantum channels with environment assistance

   • S. Karumanchi
   • S. Mancini
   • D. Yang

   Information Theory 19 October 2016 Pages: 214 - 238

3. Estimates for discontinuity jumps of information characteristics of quantum systems and channels

   • M. E. Shirokov

   Information Theory 19 October 2016 Pages: 239 - 264

4. On the symmetry group of the Mollard code

   • I. Yu. Mogilnykh
   • F. I. Solov’eva

   Coding Theory 19 October 2016 Pages: 265 - 275

5. Multicomponent codes with maximum code distance

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

   Coding Theory 19 October 2016 Pages: 276 - 283

6. On perfect codes that do not contain Preparata-like codes

   • D. S. Krotov
   • A. Yu. Vasil’eva

   Coding Theory 19 October 2016 Pages: 284 - 288

7. On extending propelinear structures of the Nordstrom–Robinson code to the Hamming code

   • I. Yu. Mogil’nykh

   Coding Theory 19 October 2016 Pages: 289 - 298

8. The problem of fair division for a hybrid resource

   • M. L. Blank

   Large Systems 19 October 2016 Pages: 299 - 307

9. The Newton and Coulomb laws as information transfer by virtual particles

   • V. A. Malyshev

   Large Systems 19 October 2016 Pages: 308 - 318