Refinements of Levenshtein Bounds in q-ary Hamming Spaces

The work was partially supported by the National Science Foundation of Bulgaria (contract number DN02 / 2-13.12.2016). This work was partially supported by the Swedish Research Council (VR) and the ELLIIT program.

Received

13.12.2018

Publication date

13.12.2018

Cite Download pdf To download PDF you should sign in

GOST	Boivalenkov P., Stoyanova M., Danev D. Refinements of Levenshtein Bounds in q-ary Hamming Spaces // Problemy peredachi informatsii – 2018. – V. 54. – Issue 4 C. 35-50 [Electronic resource]. URL: http://ras.jes.su/ppi/s055529230003077-8-1-en (circulation date: 06.05.2024). DOI: 10.31857/S055529230003077-8
MLA	Boivalenkov, Peter, Stoyanova, Maya, Danev, Danio "Refinements of Levenshtein Bounds in q-ary Hamming Spaces." Problemy peredachi informatsii 54.4 (2018):35-50. DOI: 10.31857/S055529230003077-8
APA	Boivalenkov P., Stoyanova M., Danev D. (2018). Refinements of Levenshtein Bounds in q-ary Hamming Spaces. Problemy peredachi informatsii 54(4), pp.35-50 DOI: 10.31857/S055529230003077-8

Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

Readers community rating: votes 0

1. Delsarte P., Levenshtein V.I. Association Schemes and Coding Theory // Trans. Inform. Theory. 1998. V. 44. № 6. P. 2477–2504.

2. Levenshtein V.I. Designs as Maximum Codes in Polynomial Metric Spaces // Acta Appl. Math. 1992. V. 29. № 1–2. P. 1–82.

3. Levenshtein V.I. Universal Bounds for Codes and Designs // Handbook of Coding Theory. V. I. Ch. 6. Amsterdam: Elsevier, 1998. P. 499–648.

4. Del'sart F. Algebraicheskij podkhod k skhemam otnoshenij teorii kodirovaniya. M.: Mir, 1976.

5. Levenshtein V.I. Krawtchouk Polynomials and Universal Bounds for Codes and Designs in Hamming Spaces // IEEE Trans. Inform. Theory. 1995. V. 41. № 5. P. 1303–1321.

6. Mak-Vil'yams F.Dzh., Sloehn N.Dzh.A. Teoriya kodov, ispravlyayuschikh oshibki. M.: Svyaz', 1979.

7. Tiet?av?ainen A. Bounds for Binary Codes Just Outside the Plotkin Range // Inform. Control. 1980. V. 47. № 2. P. 85–93.

8. Krasikov I., Litsyn S. Linear Programming Bounds for Codes of Small Sizes // Europ. J. Combin. 1997. V. 18. № 6. P. 647–656.

9. Sidel'nikov V.M. Ovzai mnoj korrelyatsii posledovatel'nostej // DAN SSSR. 1971. T. 196. № 3. S. 531–534.

10. Perttula A. Bounds for Binary and Nonbinary Codes Slightly Outside of the Plotkin Range: Ph.D. Thesis. Tampere Univ. of Technology. Tampere, Finland, 1982.

11. Szeg?o G. Orthogonal Polynomials. New York: Amer. Math. Soc., 1939.

12. Barg A.M., Nogin D.Yu. Spektral'nyj podkhod k granitsam linejnogo programmirovaniya dlya kodov // Probl. peredachi inform. 2006. T. 42. № 2. S. 12–25.

13. Bojvalenkov P., Danev D. Ogranitsakh linejnogo programmirovaniya dlya kodov v polinomial'nykh metricheskikh prostranstvakh // Probl. peredachi inform. 1998. T. 34. № 2. S. 16–31.

14. Krasikov I., Litsyn S., On Integral Zeros of Krawtchouk Polynomials // J. Combin. Theory Ser. A. 1996. V. 74. № 1. P. 71–99.

15. Stroeker R.J., de Weger, B.M.M. On Integral Zeroes of Binary Krawtchouk Polynomials // Nieuw Arch. Wisk. (4). 1999. V. 17. № 2. P. 175–186.

16. Bounds for Parameters of Codes. Sage Project (Software for Algebra and Geometry Experimentation). http://doc.sagemath.org/html/en/reference/coding/sage/coding/code_bounds.html.

17. Barg A., Jaffe D. Numerical Results on the Asymptotic Rate of Binary Codes // Codes and Association Schemes. DIMACS Ser., V. 56. Providence, R.I.: Amer. Math. Soc., 2001. P. 25–32.

18. Samorodnitsky A. On the Optimum of Delsarte’s Linear Program // J. Combin. Theory Ser. A. 2001. V. 96. № 2. P. 261–287.

19. Gijswijt D., Schrijver A., Tanaka H. New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming // J. Combin. Theory Ser. A. 2006. V. 113. № 8. P. 1719–1731.

20. Schrijver A. New Code Upper Bounds from the Terwilliger Algebra and Semidefinite Programming // IEEE Trans. Inform. Theory. 2005. V. 51. № 8. P. 2859–2866.

21. Litjens B., Polak S., Schrijver A. Semidefinite Bounds for Nonbinary Codes Based on Quadruples // Des. Codes Cryptography. 2017. V. 84. № 1–2. P. 87–100.

22. Brouwer A.E. Tables of Codes. http://www.win.tue.nl/~aeb/.

23. Boyd S., Vandenberghe L. Convex Optimization. Cambridge: Cambridge Univ. Press, 2004.

24. Kerdock A.M. A Class of Low-Rate Nonlinear Binary Codes // Inform. Control. 1972. V. 20. P. 182–187.

25. Agrell E., Vardy A., Zeger K. A Table of Upper Bounds for Binary Codes // IEEE Trans. Inform. Theory. 2001. V. 47. № 7. P. 3004–3006.

26. Best M.R., Brouwer A.E., MacWilliams F.J., Odlyzko A.M., Sloane N.J.A. Bounds for Binary Codes of Length Less than 25 // IEEE Trans. Inform. Theory. 1978. V. 24. № 1. P. 81–93.

27. Hedayat A., Sloane N.J.A., Stufken J. Orthogonal Arrays: Theory and Applications. New York: Springer, 1999.