Manev N L

Publications in Math-Net.Ru

1. On distance distributions of orthogonal arrays
   
   Probl. Peredachi Inf., 56:1 (2020),  51–62
2. Minimal Codewords of the Primitive BCH Codes
   
   Probl. Peredachi Inf., 34:3 (1998),  37–46
3. Binary Weight Spectrum of the Extended $[2^m,5]$ Reed–Solomon Code and its Dual Code
   
   Probl. Peredachi Inf., 30:3 (1994),  38–46
4. An Improvement of Greismer Bound for Some Classes of Distances
   
   Probl. Peredachi Inf., 23:1 (1987),  47–56
5. Minimum Possible Block Length of a Linear Binary Code for Some Distances
   
   Probl. Peredachi Inf., 20:1 (1984),  12–18
6. Characterization of Two Classes of Codes that Attain the Griesmer Bound
   
   Probl. Peredachi Inf., 19:4 (1983),  3–10