• DocumentCode
    1208235
  • Title

    Quasi-perfect Lee distance codes

  • Author

    AlBdaiwi, Bader F. ; Bose, Bella

  • Author_Institution
    Dept. of Math. & Comput. Sci., Kuwait Univ., Safat, Kuwait
  • Volume
    49
  • Issue
    6
  • fYear
    2003
  • fDate
    6/1/2003 12:00:00 AM
  • Firstpage
    1535
  • Lastpage
    1539
  • Abstract
    A construction of perfect/quasiperfect Lee distance codes in ZK2 is introduced. For this class of codes, a constant time encoding scheme is defined, the minimum code distance is derived, and the maximum covering radius is calculated. Efficient decoding schemes are investigated and developed. In general, a code of this class can be decoded in O(t1), where t1 is the number of errors that can be corrected. Special cases, however, can be decoded in constant time.
  • Keywords
    decoding; error correction codes; group theory; constant time encoding; decoding; error correction codes; finite Abelian group; maximum covering radius; minimum code distance; perfect Lee distance codes; quasi-perfect Lee distance codes; Computer science; Decoding; Encoding; Error correction codes; Fault tolerance; Graph theory; Mathematics; Multiprocessor interconnection networks; Phase modulation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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