A translation of Problemy Peredachi Informatsii

previous Volume 57, Number 4, October–December, 2021 next
Back to contents page

CONTENTS                   Powered by MathJax

New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels   [View Abstract]
A. G. D'yachkov and D. Yu. Goshkoder
pp. 301–320

On the Maximum $f$-Divergence of Probability Distributions Given the Value of Their Coupling   [View Abstract]
V. V. Prelov
pp. 321–330

On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code   [View Abstract]
V. A. Zinoviev and D. V. Zinoviev
pp. 331–340

On List Decoding of Certain $\mathbb{F}_q$-Linear Codes   [View Abstract]
N. A. Polyanskii
pp. 341–356

On Intersections of Reed–Muller Like Codes   [View Abstract]
F. I. Solov'eva
pp. 357–367

On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range   [View Abstract]
N. G. Dokuchaev
pp. 368–372

New Turán Type Bounds for Johnson Graphs   [View Abstract]
N. A. Dubinin
pp. 373–379

New Modularity Bounds for Graphs $G(n,r,s)$ and $G_p(n,r,s)$   [View Abstract]
N. M. Derevyanko and M. M. Koshelev
pp. 380–401