• DocumentCode
    1134112
  • Title

    On minimal decoding sets for the extended binary Golay code

  • Author

    Anderson, J.L.

  • Volume
    38
  • Issue
    5
  • fYear
    1992
  • fDate
    9/1/1992 12:00:00 AM
  • Firstpage
    1560
  • Lastpage
    1561
  • Abstract
    Minimal decoding sets consisting of fourteen permutations have been found for the (24,12,8) extended binary Golay code. It is shown that by properly sequencing the permutations of one such set, the average number of permutations required to decode a random received word can be minimized
  • Keywords
    decoding; error correction codes; (24,12,8) code; extended binary Golay code; minimal decoding sets; permutation decoding; random received word; Binary codes; Decoding; Information theory;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.149505
  • Filename
    149505
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1134112