• DocumentCode
    1028864
  • Title

    Minimal-change order and separability in linear codes

  • Author

    van Zanten, A.J.

  • Author_Institution
    Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands
  • Volume
    39
  • Issue
    6
  • fYear
    1993
  • fDate
    11/1/1993 12:00:00 AM
  • Firstpage
    1988
  • Lastpage
    1989
  • Abstract
    A linear code is said to be in minimal-change order if each codeword differs from its predecessor by a word of minimum weight. A rule is presented for constructing such an order in the case in which the code has a basis of codewords with minimum weight. Some consequences concerning the ranking and separability are mentioned
  • Keywords
    codes; codeword; linear code; minimal-change order; minimum weight word; ranking; separability; Binary codes; Error correction codes; Hamming distance; Linear code; Mathematics; Reflective binary codes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.265509
  • Filename
    265509
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1028864