|
|
Publications in Math-Net.Ru
-
On the Binary Self-complementary $[120,9,56]$ Codes Having an Automorphism of Order 3 and Associated SDP Designs
Probl. Peredachi Inf., 43:2 (2007), 25–33
-
The Gray–Rankin
Bound for Nonbinary Codes
Probl. Peredachi Inf., 42:3 (2006), 37–44
-
On the Error-Detecting Performance of Some Classes of Block Codes
Probl. Peredachi Inf., 40:4 (2004), 68–78
-
On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code
Probl. Peredachi Inf., 35:4 (1999), 59–67
-
On the Decoding of Some Exceptional Ternary Codes
Probl. Peredachi Inf., 31:2 (1995), 36–43
-
New Bounds for the Minimum Length of Binary Linear Block Codes
Probl. Peredachi Inf., 29:2 (1993), 41–47
-
Uniqueness of Some Linear Subcodes of the Extended Binary Golay Code
Probl. Peredachi Inf., 29:1 (1993), 45–51
-
Concatenation Method for Construction of Spherical Codes in $n$-Dimensional Euclidean Space
Probl. Peredachi Inf., 27:4 (1991), 34–38
-
A Comment on the Weight Structure of Generator Matrices of Linear Codes
Probl. Peredachi Inf., 26:2 (1990), 101–104
-
Greismer Codes with Maximum Covering Radius
Probl. Peredachi Inf., 23:4 (1987), 110–113
-
An Improvement of Greismer Bound for Some Classes of Distances
Probl. Peredachi Inf., 23:1 (1987), 47–56
-
Minimum Block Length of a Linear $q$-ary Code with Specified Dimension and Code Distance
Probl. Peredachi Inf., 20:4 (1984), 11–22
-
Minimum Possible Block Length of a Linear Binary Code for Some Distances
Probl. Peredachi Inf., 20:1 (1984), 12–18
-
Characterization of Two Classes of Codes that Attain the Griesmer Bound
Probl. Peredachi Inf., 19:4 (1983), 3–10
-
Note on the Weight Distribution for Constacyclic Codes
Probl. Peredachi Inf., 17:2 (1981), 102–103
-
Distribution of Weights of Irreducible Cyclic Codes and Strongly Regular Graphs
Probl. Peredachi Inf., 16:2 (1980), 33–39
© , 2024