Sidel'nikov Vladimir Michilovich

Publications in Math-Net.Ru

1. On the construction of $(w,r)$ cover-free codes
   
   Probl. Peredachi Inf., 45:1 (2009),  36–40
2. On a group algebra of a dihedral group and complexity of multiplication of second order matrices
   
   Tr. Diskr. Mat., 11:1 (2008),  109–118
3. An automorphism group of Suzuki $p$-group
   
   Tr. Diskr. Mat., 10 (2007),  87–96
4. On the automorphism group of a Suzuki $p$-algebra
   
   Mat. Zametki, 80:4 (2006),  526–535
5. McWilliams identity for associative schemes based on the automorphisms of finite groups
   
   Tr. Diskr. Mat., 9 (2006),  269–307
6. On an approach to the quantum codes design
   
   Tr. Diskr. Mat., 8 (2004),  128–138
7. Quantum code with code distance 5
   
   Tr. Diskr. Mat., 7 (2003),  176–190
8. Quantum Codes and Abelian Subgroups of the Extra-Special Group
   
   Probl. Peredachi Inf., 38:3 (2002),  34–44
9. Generalized Hadamard matrices and their applications
   
   Tr. Diskr. Mat., 3 (2000),  249–268
10. Orbital spherical 11-designs in which the initial point is a root of an invariant polynomial
    
    Algebra i Analiz, 11:4 (1999),  183–203
11. Algorithms for Generation of a Common Key Using a Quantum Communication Channel
    
    Probl. Peredachi Inf., 35:1 (1999),  100–109
12. On the spectrum of orbit codes in the space of matrices
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1998, no. 5,  58–61
13. On One Finite Matrix Group and Codes on Euclidean Spheres
    
    Probl. Peredachi Inf., 33:1 (1997),  35–54
14. On some arithmetical properties of orbit codes in a space of matrices
    
    Uspekhi Mat. Nauk, 52:6(318) (1997),  185–186
15. Fast algorithms for constructing a set of labelings of discrete data files
    
    Tr. Diskr. Mat., 1 (1997),  251–264
16. Open coding based on Reed–Muller binary codes
    
    Diskr. Mat., 6:2 (1994),  3–20
17. Key Distribution System Based on Exponential Representations of Linear Group $GL_n(F_p)$
    
    Probl. Peredachi Inf., 30:4 (1994),  25–32
18. Decoding Reed–Solomon Codes Beyond $(d-1)/2$ and Zeros of Multivariate Polynomials
    
    Probl. Peredachi Inf., 30:1 (1994),  51–69
19. Public key distribution systems based on noncommutative semigroups
    
    Dokl. Akad. Nauk, 332:5 (1993),  566–567
20. Decoding the Reed–Solomon code when the number of errors is greater than half of the code distance
    
    Dokl. Akad. Nauk, 330:1 (1993),  20–23
21. On an encoding system constructed on the basis of generalized Reed–Solomon codes
    
    Diskr. Mat., 4:3 (1992),  57–63
22. Entropy of Some Binary Sources
    
    Probl. Peredachi Inf., 28:4 (1992),  3–13
23. Decoding of Reed?Muller Codes with a Large Number of Errors
    
    Probl. Peredachi Inf., 28:3 (1992),  80–94
24. Estimates for the number of appearances of elements on an interval of a recurrent sequence over a finite field
    
    Diskr. Mat., 3:2 (1991),  87–95
25. Codes Associated with the Linear Fractional Group
    
    Probl. Peredachi Inf., 25:1 (1989),  3–15
26. Codes that are connected with a group of linear-fractional transformations
    
    Dokl. Akad. Nauk SSSR, 301:5 (1988),  1041–1044
27. On normal bases of a finite field
    
    Mat. Sb. (N.S.), 133(175):4(8) (1987),  497–507
28. Linear Ternary Quasi-perfect Codes Correcting Double Errors
    
    Probl. Peredachi Inf., 22:4 (1986),  43–48
29. On Extremal Polynomials Used in Bounds of Code Volume
    
    Probl. Peredachi Inf., 16:3 (1980),  17–30
30. Upper Bounds for the Number of Points of a Binary Code with a Specified Code Distance
    
    Probl. Peredachi Inf., 10:2 (1974),  43–51
31. New bounds for densest packing of spheres in $n$-dimensional Euclidean space
    
    Mat. Sb. (N.S.), 95(137):1(9) (1974),  148–158
32. On the densest packing of balls on the surface of an $n$-dimensional Euclidean sphere and the number of binary code vectors with a given code distance
    
    Dokl. Akad. Nauk SSSR, 213:5 (1973),  1029–1032
33. On mutual correlation of sequences
    
    Dokl. Akad. Nauk SSSR, 196:3 (1971),  531–534
34. Weight Spectrum of Binary Bose–Chaudhuri–Hoquinghem Codes
    
    Probl. Peredachi Inf., 7:1 (1971),  14–22
35. Some $k$-Valued Pseudo-random Sequences and Nearly Equidistant Codes
    
    Probl. Peredachi Inf., 5:1 (1969),  16–22