Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter M. Kovačević Information Theory 27 January 2021 Pages: 303 - 308
On Bases of BCH Codes with Designed Distance 3 and Their Extensions I. Yu. MogilnykhF. I. Solov’eva Coding Theory 27 January 2021 Pages: 309 - 316
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis A. V. KharinK. N. ZavertkinA. A. Ovinnikov Coding Theory 27 January 2021 Pages: 317 - 331
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs S. ZhouZ. SunQ. Pan Large Systems 27 January 2021 Pages: 332 - 344
On Stability of the Independence Number of a Certain Distance Graph P. A. OgarokA. M. Raigorodskii Large Systems 27 January 2021 Pages: 345 - 357
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
Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form L. A. Sholomov Source Coding 27 January 2021 Pages: 373 - 387
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise E. E. EgorovaM. FernandezY. Miao Information Protection 27 January 2021 Pages: 388 - 398
Retraction Note: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo L. A. Bassalygo Retraction Note 27 January 2021 Pages: 399 - 399