• DocumentCode
    942167
  • Title

    Decomposing and shortening codes using automorphisms (Corresp.)

  • Author

    Huffman, W. Cary

  • Volume
    32
  • Issue
    6
  • fYear
    1986
  • fDate
    11/1/1986 12:00:00 AM
  • Firstpage
    833
  • Lastpage
    836
  • Abstract
    Codes possessing certain types of automorphisms are examined. In one case, the code can be decomposed as a direct sum of two subcodes, which can be viewed as shorter length codes. In a second case, the code itself corresponds to a shorter length code. Related results and applications are given.
  • Keywords
    Coding/decoding; Combinatorial mathematics; Decoding; Eigenvalues and eigenfunctions; Galois fields; Linear code; Niobium; Silicon carbide; Terminology; Testing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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