List of Publications

Books:

Editor of books:

Articles

  1. V.Zinoviev, S.Litsyn, Lengthening of codes, Problems of Information Transmission, v.18, 4, 1982, pp. 244-254.
  2. S.Litsyn, O.Shekhovtsov, Fast decoding algorithm for first order Reed-Muller codes, Problems of Information Transmission, v.19, 2, 1983, pp. 87-91.
  3. V.Zinoviev, S.Litsyn, Shortening of codes, Problems of Information Transmission, v.20, 1, 1984, pp. 1-7.
  4. S.Litsyn, New non-linear codes with a minimal distance of 3, Problems of Control and Information Theory, v.13, 1, 1984, pp. 13-15.
  5. V.Zinoviev, S.Litsyn, On a general method of increasing the length of codes, Problems of Control and Information Theory, v.13, 2, 1984, pp. 79-87.
  6. A.Dudkin, S.Litsyn, O.Shekhovtsov, A.Shitov, Decoding of BCH-codes up to t+1 errors, Problems of Radioelectronics, v.13, 1984, pp. 83-85 (Rus.)
  7. V.Zinoviev, S.Litsyn, On codes exceeding the Gilbert bound, Problems of Information Transmission, v.21, 1, 1985, pp. 109-111 (Rus.)
  8. S.Litsyn, M.Tsfasman, Algebro-geometric and number-theoretic sphere-packings in R^n, Russian Mathematical Surveys, v.40, 2, 1985, pp. 185-186.
  9. S.Litsyn, E.Nemirovsky, O.Shekhovtsov, L.Mikhailovskaya, Fast decoding of first order Reed-Muller codes in the Gaussian channel, Problems of Control and Information Theory, v.14, 3, 1985, pp. 189-201.
  10. S.Litsyn, O.Shekhovtsov, Fast decoding of first order Reed-Muller codes in the channel with erasures, Priborostroyenie, v.28, 9, 1985, pp. 27-31 (Rus.)
  11. S.Litsyn , A.Yuzhakov, Sample encoding in cyclic discretization in an information-measuring system, Priborostroyenie, v.29, 7, 1986, pp. 10-15 (Rus.)
  12. S.Litsyn, M.Tsfasman, A note on the lower bounds, IEEE Transactions on Information Theory, IT- 32, 5, 1986, pp. 705-706.
  13. G.Katsman, S.Litsyn, Double reliable separating systems, Automatika and Telemekhanika, v.11, 1986, pp. 114-117.
  14. V.Zinoviev, S.Litsyn, On the dual distance of BCH-codes, Problems of Information Transmission, v.22, 4, 1986, pp. 272-277.
  15. V.Zinoviev, S.Litsyn, On a general construction of codes' shortening, Problems of Information Transmission, v.23, 2, 1987, pp. 111-116.
  16. S.Litsyn , M.Tsfasman, Constructive high-dimensional sphere-packings Duke Mathematical Journal, v.54, 1, 1987, pp. 147-161.
  17. V.Zinoviev, S.Litsyn, Lower bounds on overall rational trigonometric sums, Russian Mathematical Surveys, v.43, 1(259), 1988, pp. 199-200.
  18. S.Litsyn, E.Nemirovsky, Simplification of maximum likelihood decoding of block codes based on the Viterbi algorithm, Transactions of Radio Institute, Moscow, 2, 1988, pp.18-27 (Rus.)
  19. A.Ashikhmin, S.Litsyn, Analysis of quasioptimal algorithms for decoding of biorthogonal codes, Radioelectronica, v.31, 11, 1988, pp. 30-34 (Rus.)
    English translation: in Radio Electronics and Communication Systems, v.31, n.11, pp. 26-30, 1988.
  20. S.Litsyn, S.Makarenko, Estimation of minimal disbalance in multilevel balance codes. Communication devices, 4, 1988, pp. 39-42 (Rus.)
  21. L.Bassalygo, V.Zinoviev, S.Litsyn, Lower estimates for overall trigonometric sums via multiple sums, Doklady of the USSR Academy of Sciences, v.300, 5, 1988, pp. 1033-1036.
  22. V.Zinoviev, S.Litsyn , S.Portnoy, Cascade codes in Euclidean space, Problems of Information Transmission, v.25, 3, 1989, pp. 62-75.
  23. L.Bassalygo, V.Zinoviev, S.Litsyn, Lower bound for overall exponential sum for polynomials f(x^d) , Periodica Matematica Hungarica, v.20, 4, 1989, pp. 279-287.
  24. A.Ashikhmin, S.Litsyn, A list algorithm for locating the maximal element in the Walsh spectrum, Radioelectronica, v.32, 3, 1990, pp. 15-22 (Rus.)
    English translation: in Radio Electronics and Communication Systems, v.32, n.11, pp. 37-41, 1990.
  25. A.Botvinnik, A.Bartulli, S.Litsyn, Error-correcting coding in the PCM-30 system, Communication devices, 1, 1990, pp.16-18. (Rus.)
  26. A.Barg, S.Litsyn, What is fortune, or how not to loose in football pool?, Quantum, 9, 1990, pp. 8-16. (Rus.)
  27. G. van Wee, G.Cohen, S.Litsyn, A note on perfect multiple coverings of the Hamming space, IEEE Transactions on Information Theory, v.37, 3, part 1, 1991, pp. 678-682.
  28. A.Barg, S.Litsyn, DC-constrained codes from Hadamard matrices, IEEE Transactions on Information Theory, v.37, 3, part 2, 1991, pp. 801-808.
  29. G.Cohen, S.Litsyn, Codes with small running digital sum, IEEE Transactions on Information Theory v.37, 3, part 2, 1991, pp. 949-955.
  30. G.Cohen, S.Litsyn, On the covering radius of Reed-Muller codes, Discrete Mathematics, v. 106-107, 1992, pp. 147-155.
  31. M.Blaum, V.Buskens, S.Litsyn , H.C.A. van Tilborg, Error-correcting codes with bounded running digital sum, IEEE Transactions on Information Theory, v.39, 1, 1993, pp. 216-228.
  32. H.Hamalainen, I.Honkala, M.Kaikkonen, S.Litsyn, Bounds for binary multiple covering codes, Designs, Codes and Cryptography, v.3, 1993, pp.251-275.
  33. S.Litsyn, A.Tietavainen, Character sum constructions of constrained error-correcting codes, Applicable Algebra in Engineering, Communication and Computing, v.5, 1, 1994, pp. 45--51.
  34. S.Litsyn, C.J.Moreno, O.Moreno, Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables, Applicable Algebra in Engineering, Communication and Computing, v.5, 2, 1994, pp. 105--116.
  35. S.Litsyn, A.Vardy, The uniqueness of the Best code, IEEE Transactions on Information Theory, v.40, 5, 1994, pp. 1693-1699.
  36. G.Cohen, S.Litsyn, G.Zemor, Upper bounds on generalized distances \ IEEE Transactions on Information Theory, v.40, 6, 1994, pp. 2090-2092.
  37. I.Krasikov, S.Litsyn, On spectra of BCH codes IEEE Transactions on Information Theory, v.41, 3, 1995, pp.786-788.
  38. I.Krasikov, S.Litsyn, On the accuracy of the binomial approximation to the distance distribution of codes, IEEE Transactions on Information Theory, v.41, 5, 1995, pp.1472--1474.
  39. H.Hamalainen, I.Honkala, S.Litsyn, Bounds for binary codes that are multiple coverings of the farthest off points, SIAM Journal of Discrete Mathematics , vol.8, 2, 1995, pp.196--207.
  40. Y.Klein, S.Litsyn, A.Vardy, Two new bounds on the size of binary codes with a minimum distance of three, Designs, Codes and Cryptography , vol.6, No.3, 1995,, pp.219--227.
  41. H.Hamalainen, I.Honkala, S.Litsyn, P.Ostergard, Football pools - a game for mathematicians, The American Mathematical Monthly , vol.102, No.7, {\bf 1995}, pp.579--588.
  42. G.Cohen, I.Honkala, S.Litsyn, H.F.Mattson, Jr., Weighted coverings and packings, IEEE Transactions on Information Theory , v.41, No.6, Part II, 1995, pp.1856--1867.
  43. A.Ashikhmin, S.Litsyn, Fast decoding algorithms for first order Reed-Muller and related codes, Designs, Codes and Cryptography , vol.7, No.3, 1996, pp.187--214.
  44. I.Krasikov, S.Litsyn, On integral zeros of Krawtchouk polynomials, Journal of Combinatorial Theory , Ser.A}, v.150, 1996, pp.441--447.
  45. S.Litsyn , A.Tiet\"{a}v\"{a}inen, More on the covering radius of BCH codes, IEEE Transactions on Information Theory , v.42, 1996, pp.1023--1028.
  46. I.Honkala, S.Litsyn, Generalizations of the covering radius problem in coding theory , Bulletin of the ICA, v.17, 1996, pp.39--46.
  47. A.Ashikhmin, S.Litsyn, Fast decoding of nonbinary orthogonal codes\ Applicable Algebra in Engineering, Communication and Computing, v.7, No.4, 1996, pp.299--308.
  48. G.Cohen, S.Litsyn, A.Vardy, G.Z\'{e}mor, Tilings of binary spaces, SIAM J. of Discrete Mathematics, v.9, No.3, 1996, pp.393--412.
  49. G.Cohen, S.Litsyn, G.Z\'{e}mor, On the traveling salesman problem in Hamming spaces, IEEE Transactions on Information Theory , v.42, No.4, 1996, pp.1274--1276.
  50. G.Cohen, S.Litsyn, G.Z\'{e}mor, On greedy algorithms in coding theory, IEEE Transactions on Information Theory , v.42, No.6, 1996, pp.2053--2057.
  51. G.Cohen, S.Litsyn, A.Lobstein, H.F.Mattson, Jr., Covering radius 1985--1994, Applicable Algebra in Engineering, Communication and Computing , (special issue), vol. 8, 1997, pp. 173--240.
  52. I.Krasikov, S.Litsyn, Estimates for the range of binomiality in codes' spectra IEEE Transactions on Information Theory vol.43, 3, 1997, pp.987--991.
  53. I.Krasikov, S.Litsyn, Linear programming bounds for doubly-even self-dual codes, IEEE Transactions on Information Theory , vol.43, 4, 1997, pp.1238--1244.
  54. I.Honkala, T.Laihonen, S.Litsyn, On covering radius and discrete Chebyshev polynomials, Applicable Algebra in Engineering, Communication and Computing , vol.8, 1997, pp.395--401.
  55. G.Cohen, I.Honkala, S.Litsyn, P.Sol\'{e}, Long packing and covering codes, IEEE Transactions on Information Theory , vol. 43, 5, 1997, pp. 1617--1619.
  56. I.Krasikov, S.Litsyn, Linear programming bounds for codes of small size, European J. of Combinatorics, vol. 18, 1997, pp.647--656.
  57. O.Keren, S.Litsyn, A class of array codes correcting multiple column erasures, IEEE Trans. on Information Theory , vol.43, 6, {\bf 1997}, pp.1843--1851.
  58. H.D.L.Hollman, J.Korner, S.Litsyn, Tiling Hamming space with few spheres, J. Combinatorial Th., Ser. A, vol.80, 1997, pp.388-393.
  59. G.Cohen, I.Honkala, S.Litsyn, P.Sol\'{e}, Long packing and covering codes, IEEE Transactions on Information Theory , vol. 43, 5, 1997, pp. 1617--1619. .
  60. F. Levy-dit-Vehel, S.Litsyn, Parameters of Goppa codes revisited, IEEE Transactions on Information Theory , vol.43, 6, 1997, pp.1811--1819. .
  61. I.Krasikov, S.Litsyn, Linear programming bounds for doubly-even self-dual codes, IEEE Transactions on Information Theory , vol.43, 4, 1997, pp.1238--1244.
  62. I.Krasikov, S.Litsyn, Bounds on spectra of codes with known dual distance, Designs, Codes and Cryptography vol.13, 3, 1998, pp.285--298.
  63. T.Laihonen, S.Litsyn, On upper bounds for minimum distance and covering radius of non-binary codes, Designs, Codes and Cryptography , vol.14, 1, 1998, pp.71--80.
  64. O.Keren, S.Litsyn, Codes correcting phased burst errors, IEEE Transactions on Information Theory , vol.44, 1, {\bf 1998}, pp.416--420.

    Papers published in refereed books

  65. G.Katsman, S.Kovalev, S.Litsyn, New codes derived by lengthening, In book: "Error-correcting coding and reliability of computers", Moscow, Nauka, 1987, pp. 7-10. (Rus.)
  66. M.Zhitkov, S.Litsyn, Constructions of unit-memory codes, In book: "Error-correcting coding and reliability of computers", Moscow, Nauka, 1987, pp. 10-17.
  67. S.Litsyn, Fast algorithms for decoding orthogonal and related codes, In book: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, Springer-Verlag, v.539, 1992, pp. 39-47.
  68. G.Cohen, S.Litsyn , H.F.Mattson,Jr., On perfect weighted coverings with small radius, In book: Algebraic Coding , Lecture Notes in Computer Science, Springer-Verlag, v.573, 1992, pp. 32-41.
  69. A.Ashikhmin, S.Litsyn, A fast search for the maximum element of the Fourier spectrum, In book: Algebraic Coding , Lecture Notes in Computer Science, Springer-Verlag, v.573, 1992, pp. 134-141.
  70. G.Cohen, S.Litsyn , H.F.Mattson, Jr., Binary Perfect Weighted Coverings., In book: Sequences II, Springer-Verlag, 1993, pp. 36-51.
  71. G.Cohen, I.Honkala, S.Litsyn, Perfect weighted coverings of radius one, In book: Eurocode 92, ICMS, Courses and Lectures, No.339, Springer-Verlag, 1993.
  72. S.Litsyn, A.Vardy, Two new upper bounds for codes of distance 3, In book: Algebraic Coding, Lecture Notes in Computer Science, Springer-Verlag, v.781, 1994, pp. 253-262.
  73. I.Honkala, S.Litsyn, A.Tiet\"av\"ainen, On algebraic methods in covering radius problems, In book: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, v.948, Springer-Verlag, 1995, pp.21--32.
  74. F. Levy-dit-Vehel, S.Litsyn, On the covering radius of long Goppa codes, In book: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , Lecture Notes in Computer Science, v.948, Springer-Verlag, 1995, pp.341-346.

    Accepted for publication

  75. U.Blass, S.Litsyn, Several new lower bounds for football pool systems, Ars Combinatoria .
  76. U.Blass, S.Litsyn, The smallest covering code of length 8 and radius 2 has 12 words, Ars Combinatoria .
  77. O.Keren, S.Litsyn, More on the distance distribution of BCH codes, IEEE Transactions on Information Theory .

    Submitted for publication

  78. I.Krasikov, S.Litsyn, On the distance distribution of duals of BCH codes, IEEE Transactions on Information Theory .
  79. A.Ashikhmin, S.Litsyn, Upper bounds on the size of quantum codes, IEEE Trans. on Information Theory
  80. S.Litsyn, New upper bounds on error exponents, IEEE Trans. on Information Theory
  81. I.Krasikov, S.Litsyn, An improved upper bound on the minimum distance of doubly-even self-dual codes, IEEE Trans. on Information Theory
  82. G.Freiman, S.Litsyn, Asymptotically exact bounds on the size of high-order spectral-null codes, IEEE Trans. on Information Theory

If you have any comments or questions about this page, please send them to litsyn@eng.tau.ac.il
Last modified on 26.07.1998