|
|
Publications in Math-Net.Ru
-
List Decoding of Binary First-Order Reed-Muller Codes
Probl. Peredachi Inf., 43:3 (2007), 66–74
-
An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space
Probl. Peredachi Inf., 38:2 (2002), 3–18
-
Epsilon-entropy of an Ellipsoid in a Hamming Space
Probl. Peredachi Inf., 38:1 (2002), 3–18
-
Asymptotically Optimal Linear Codes Correcting Defects of Linearly Increasing Multiplicity
Probl. Peredachi Inf., 26:2 (1990), 3–17
-
Asymptotically Optimal Codes Correcting Memory Defects of Fixed Multiplicity
Probl. Peredachi Inf., 25:4 (1989), 3–10
-
Two Decoding Algorithms for Linear Codes
Probl. Peredachi Inf., 25:1 (1989), 24–32
-
Nonbinary Codes with Distances 4, 5, and 6 of Cardinality Greater than the BCH Codes
Probl. Peredachi Inf., 24:3 (1988), 42–54
-
Concatenated Decoding Algorithm with Incomplete Inspection of Code Vectors
Probl. Peredachi Inf., 22:1 (1986), 3–10
-
Remarks on tactical configurations in codes
Mat. Zametki, 28:1 (1980), 159–166
-
Some New Maximal Codes over $GF(4)$
Probl. Peredachi Inf., 14:3 (1978), 24–34
-
Mark Semenovich Pinsker. In Memoriam
Probl. Peredachi Inf., 40:1 (2004), 3–5
© , 2026