Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES

  • Le, Thi Ngoc Giau (Faculty of Mathematics and Statistics Ton Duc Thang University) ;
  • Phan, Thanh Toan (Fractional Calculus, Optimization and Algebra Research Group Faculty of Mathematics and Statistics Ton Duc Thang University)
  • Received : 2018.03.29
  • Accepted : 2018.06.21
  • Published : 2019.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

Keywords

References

  1. E. Agrell, A. Vardy, and K. Zeger, A table of upper bounds for binary codes, IEEE Trans. Inform. Theory 47 (2001), no. 7, 3004-3006. https://doi.org/10.1109/18.959279
  2. J. Bao and L. Ji, The completion determination of optimal (3, 4)-packings, Des. Codes Cryptogr. 77 (2015), no. 1, 217-229. https://doi.org/10.1007/s10623-014-0001-2
  3. M. R. Best, Binary codes with a minimum distance of four, IEEE Trans. Inform. Theory 26 (1980), no. 6, 738-742. https://doi.org/10.1109/TIT.1980.1056269
  4. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes, North-Holland Mathematical Library, 54, North-Holland Publishing Co., Amsterdam, 1997.
  5. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. No. 10 (1973), vi+97 pp.
  6. K. Elssel and K.-H. Zimmermann, Two new nonlinear binary codes, IEEE Trans. Inform. Theory 51 (2005), no. 3, 1189-1190. https://doi.org/10.1109/TIT.2004.842767
  7. D. C. Gijswijt, H. D. Mittelmann, and A. Schrijver, Semidefinite code bounds based on quadruple distances, IEEE Trans. Inform. Theory 58 (2012), no. 5, 2697-2705. https://doi.org/10.1109/TIT.2012.2184845
  8. W. Haas, On the failing cases of the Johnson bound for error-correcting codes, Electron. J. Combin. 15 (2008), no. 1, Research paper 55, 13 pp.
  9. S. M. Johnson, A new upper bound for error-correcting codes, IRE Trans. IT-8 (1962), 203-207.
  10. M. K. Kaikkonen, A new four-error-correcting code of length 20, IEEE Trans. Inform. Theory 35 (1989), no. 6, 1344. https://doi.org/10.1109/18.45298
  11. M. K. Kaikkonen, Codes from affine permutation groups, Des. Codes Cryptogr. 15 (1998), no. 2, 183-186. https://doi.org/10.1023/A:1008315701179
  12. H. K. Kim and P. T. Toan, Improved semidefinite programming bound on sizes of codes, IEEE Trans. Inform. Theory 59 (2013), no. 11, 7337-7345. https://doi.org/10.1109/TIT.2013.2277714
  13. Y. Klein, S. Litsyn, and A. Vardy, Two new bounds on the size of binary codes with a minimum distance of three, Des. Codes Cryptogr. 6 (1995), no. 3, 219-227. https://doi.org/10.1007/BF01388476
  14. A. Laaksonen and P. R. J. Ostergard, Constructing error-correcting binary codes using transitive permutation groups, Discrete Appl. Math. 233 (2017), 65-70. https://doi.org/10.1016/j.dam.2017.08.022
  15. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. I, North-Holland Publishing Co., Amsterdam, 1977.
  16. M. Milshtein, A new binary code of length 16 and minimum distance 3, Inform. Process. Lett. 115 (2015), no. 12, 975-976. https://doi.org/10.1016/j.ipl.2015.07.001
  17. B. Mounits, T. Etzion, and S. Litsyn, Improved upper bounds on sizes of codes, IEEE Trans. Inform. Theory 48 (2002), no. 4, 880-886. https://doi.org/10.1109/18.992776
  18. B. Mounits, T. Etzion, and S. Litsyn, New upper bounds on codes via association schemes and linear programming, Adv. Math. Commun. 1 (2007), no. 2, 173-195. https://doi.org/10.3934/amc.2007.1.173
  19. P. R. J. Ostergard, Two new four-error-correcting binary codes, Des. Codes Cryptogr. 36 (2005), no. 3, 327-329. https://doi.org/10.1007/s10623-004-1723-3
  20. P. R. J. Ostergard, On optimal binary codes with unbalanced coordinates, Appl. Algebra Engrg. Comm. Comput. 24 (2013), no. 3-4, 197-200. https://doi.org/10.1007/s00200-013-0189-9
  21. P. R. J. Ostergard, T. Baicheva, and E. Kolev, Optimal binary one-error-correcting codes of length 10 have 72 codewords, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1229-1231. https://doi.org/10.1109/18.761273
  22. A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (2005), no. 8, 2859-2866. https://doi.org/10.1109/TIT.2005.851748