• DocumentCode
    1316636
  • Title

    A table of state complexity bounds for binary linear codes

  • Author

    Schuurman, Petra

  • Author_Institution
    Dept. of Math., Eindhoven Univ. of Technol., Netherlands
  • Volume
    42
  • Issue
    6
  • fYear
    1996
  • fDate
    11/1/1996 12:00:00 AM
  • Firstpage
    2034
  • Lastpage
    2042
  • Abstract
    This article contains a table of bounds on the state complexity of binary linear codes with length smaller than 25. General results on the state complexity of binary linear codes with low dimension or low minimum distance are included
  • Keywords
    binary sequences; block codes; computational complexity; linear codes; matrix algebra; binary linear codes; generator matrix; low dimension codes; low minimum distance codes; state complexity bounds; table; Block codes; Decoding; Hamming distance; Linear code; Mathematics; State-space methods; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.556700
  • Filename
    556700
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1316636