Litsyn S N

Publications in Math-Net.Ru

1. Concatenated Codes in Euclidean Space
   
   Probl. Peredachi Inf., 25:3 (1989),  62–75
2. A lower bound for complete trigonometric sums in terms of multiple sums
   
   Dokl. Akad. Nauk SSSR, 300:5 (1988),  1033–1036
3. Lower bounds for complete rational trigonometric sums
   
   Uspekhi Mat. Nauk, 43:1(259) (1988),  199–200
4. On the General Code Shortening Construction
   
   Probl. Peredachi Inf., 23:2 (1987),  28–34
5. Dual fail-safe separating systems
   
   Avtomat. i Telemekh., 1986, no. 11,  114–117
6. On the Dual Distance of BCH Codes
   
   Probl. Peredachi Inf., 22:4 (1986),  29–34
7. On Codes Beyond the Gilbert Bound
   
   Probl. Peredachi Inf., 21:1 (1985),  109–111
8. Algebro-geometrical and number-theoretical packings of balls in $\mathbb R^N$
   
   Uspekhi Mat. Nauk, 40:2(242) (1985),  185–186
9. On Shortening of Codes
   
   Probl. Peredachi Inf., 20:1 (1984),  3–11
10. Fast Decoding Algorithms for First-Order Reed–Muller codes
    
    Probl. Peredachi Inf., 19:2 (1983),  3–7
11. On Methods of Code Lengthening
    
    Probl. Peredachi Inf., 18:4 (1982),  29–42