• DocumentCode
    934776
  • Title

    Minimal permutation sets for decoding the binary Golay codes (Corresp.)

  • Author

    Gordon, Daniel M.

  • Volume
    28
  • Issue
    3
  • fYear
    1982
  • fDate
    5/1/1982 12:00:00 AM
  • Firstpage
    541
  • Lastpage
    543
  • Abstract
    For permutation decoding of an e error-correcting linear code, a set of permutations which move all error vectors of weight \\leq e out of the information places is needed. A method of finding minimal decoding sets is given, along with minimal sets obtained with this method for the binary Golay codes.
  • Keywords
    Golay coding; Linear coding; Permutations; Binary codes; Decoding; Error correction codes; Linear code; Parity check codes; Seminars; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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