Boyvalenkov Peter

Publications in Math-Net.Ru

1. On codes with distances $d$ and $n$
   
   Probl. Peredachi Inf., 58:4 (2022),  62–83
2. On $q$-ary codes with two distances $d$ and $d+1$
   
   Probl. Peredachi Inf., 56:1 (2020),  38–50
3. Refinements of Levenshtein bounds in $q$-ary Hamming spaces
   
   Probl. Peredachi Inf., 54:4 (2018),  35–50
4. Nonexistence of binary orthogonal arrays via their distance distributions
   
   Probl. Peredachi Inf., 51:4 (2015),  23–31
5. Investigation of binary orthogonal arrays via their distance distributions
   
   Probl. Peredachi Inf., 49:4 (2013),  28–40
6. A method for proving nonexistence of spherical designs of odd strength and odd cardinality
   
   Probl. Peredachi Inf., 45:2 (2009),  41–55
7. On Linear Programming Bounds for Codes in Polynomial Metric Spaces
   
   Probl. Peredachi Inf., 34:2 (1998),  16–31