1. Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter

   • M. Kovačević

   Information Theory 27 January 2021 Pages: 303 - 308

   

2. On Bases of BCH Codes with Designed Distance 3 and Their Extensions

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

   Coding Theory 27 January 2021 Pages: 309 - 316

3. Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis

   • A. V. Kharin
   • K. N. Zavertkin
   • A. A. Ovinnikov

   Coding Theory 27 January 2021 Pages: 317 - 331

   

4. A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs

   • S. Zhou
   • Z. Sun
   • Q. Pan

   Large Systems 27 January 2021 Pages: 332 - 344

5. On Stability of the Independence Number of a Certain Distance Graph

   • P. A. Ogarok
   • A. M. Raigorodskii

   Large Systems 27 January 2021 Pages: 345 - 357

   

6. Peculiar Properties of the p-Linear Decomposition of p-Linear Functions in Terms of the Shift-Composition Operation

   • I. V. Cherednik

   Automata Theory 27 January 2021 Pages: 358 - 372

7. Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form

   • L. A. Sholomov

   Source Coding 27 January 2021 Pages: 373 - 387

8. Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise

   • E. E. Egorova
   • M. Fernandez
   • Y. Miao

   Information Protection 27 January 2021 Pages: 388 - 398

9. Retraction Note: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo

   • L. A. Bassalygo

   Retraction Note 27 January 2021 Pages: 399 - 399