• DocumentCode
    1478841
  • Title

    Every binary (2m-2, 22(m)-2-m, 3) code can be lengthened to form a perfect code of length 2m-1

  • Author

    Blackmore, Tim

  • Author_Institution
    Centre for Commun. Res., Bristol Univ., UK
  • Volume
    45
  • Issue
    2
  • fYear
    1999
  • fDate
    3/1/1999 12:00:00 AM
  • Firstpage
    698
  • Lastpage
    700
  • Abstract
    We answer a problem posed by Etzion and Vardy (1998) by showing that a binary code of length N=2(m)-2 with 2(N-m) codewords and minimum distance three can always be lengthened to form a perfect code of length 2(m-1)
  • Keywords
    binary codes; binary code; codewords; length; lengthened code; minimum distance; perfect code; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.749014
  • Filename
    749014
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1478841