• DocumentCode
    1203623
  • Title

    Quasi-perfect codes with small distance

  • Author

    Etzion, Tuvi ; Mounits, Beniamin

  • Author_Institution
    Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
  • Volume
    51
  • Issue
    11
  • fYear
    2005
  • Firstpage
    3938
  • Lastpage
    3946
  • Abstract
    The main purpose of this paper is to give bounds on the length of the shortest and longest binary quasi-perfect codes with a given Hamming distance, covering radius, and redundancy. We consider codes with Hamming distance 4 and 5 and covering radius 2 and 3, respectively. We discuss the blockwise direct sum (BDS) construction which has an important role in finding these bounds.
  • Keywords
    Hamming codes; binary codes; block codes; BDS; Hamming distance; binary quasi-perfect code; blockwise direct sum construction; packing; Binary codes; Cities and towns; Computer science; Hamming distance; Information theory; Materials science and technology; Mathematics; Blockwise direct sum (BDS) construction; covering; density; packing; quasi-perfect codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2005.856944
  • Filename
    1522651
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1203623