PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS                  

Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter   [View Abstract]
M. Kovačević
pp. 303–308

On Bases of BCH Codes with Designed Distance 3 and Their Extensions   [View Abstract]
I. Yu. Mogilnykh and F. I. Solov'eva
pp. 309–316

Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis   [View Abstract]
A. V. Kharin, K. N. Zavertkin, and A. A. Ovinnikov
pp. 317–331

A Sufficient Condition for the Existence of Restricted Fractional $(g,f)$-Factors in Graphs   [View Abstract]
S. Zhou, Z. Sun, and Q. Pan
pp. 332–344

On Stability of the Independence Number of a Certain Distance Graph   [View Abstract]
P. A. Ogarok and A. M. Raigorodskii
pp. 345–357

Peculiar Properties of the $p$-Linear Decomposition of $p$-Linear Functions in Terms of the Shift-Composition Operation   [View Abstract]
I. V. Cherednik
pp. 358–372

Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form   [View Abstract]
L. A. Sholomov
pp. 373–387

Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise   [View Abstract]
E. E. Egorova, M. Fernandez, G. A. Kabatiansky, and Y. Miao
pp. 388–398

Retraction Note: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo   [View Abstract]
L. A. Bassalygo
p. 399