• DocumentCode
    3020973
  • Title

    New results on optimal error-correcting codes

  • Author

    Östergård, Patric R J

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Helsinki Univ. of Technol., Finland
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    120
  • Abstract
    Let Aq(n,d) denote the maximum cardinality of a q-ary code with length n and minimum distance d. An approach for classifying such error-correcting codes-and thereby obtaining values of Aq(n, d)-is presented. Using this approach, which is based on backtrack search and isomorphism rejection, several open cases have been settled, including A2(10,3)=A2(11,4)=72, A2 (11,3)=A2(12,4)=144, A3(6,3)=38, A3 (7,4)=33, and A3(8,4)=99
  • Keywords
    binary codes; error correction codes; ternary codes; backtrack search; binary codes; isomorphism rejection; maximum cardinality; minimum distance; optimal error-correcting codes; q-ary code; ternary codes; Computer errors; Error correction codes; Labeling; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE
  • Conference_Location
    Kruger National Park
  • Print_ISBN
    0-7803-5268-8
  • Type

    conf

  • DOI
    10.1109/ITCOM.1999.781451
  • Filename
    781451
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3020973