• DocumentCode
    34116
  • Title

    Cyclically permutable codes specified by roots of generator polynomial

  • Author

    Lemos-Neto, J.S. ; da Rocha, V.C.

  • Author_Institution
    Fed. Univ. of Pernambuco, Recife, Brazil
  • Volume
    50
  • Issue
    17
  • fYear
    2014
  • fDate
    Aug. 14 2014
  • Firstpage
    1202
  • Lastpage
    1204
  • Abstract
    A condition is proven on the roots of the generator polynomial of a q-ary cyclic code of block length n which guarantees full cyclic order for all nonzero codewords. For such cyclic codes having n = qm- 1, a theorem is proven which allows to partition the set of all nonzero codewords into cyclic equivalence classes of order n.
  • Keywords
    cyclic codes; polynomials; block length; cyclic equivalence; cyclically permutable codes; full cyclic order; generator polynomial; nonzero codewords; q-ary cyclic code;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el.2014.0296
  • Filename
    6880211
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=34116