• DocumentCode
    1460487
  • Title

    Cyclic Codes From the Two-Prime Sequences

  • Author

    Ding, Cunsheng

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China
  • Volume
    58
  • Issue
    6
  • fYear
    2012
  • fDate
    6/1/2012 12:00:00 AM
  • Firstpage
    3881
  • Lastpage
    3891
  • Abstract
    Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, the two-prime sequence is employed to construct several classes of cyclic codes over GF(q). Lower bounds on the minimum weight of these cyclic codes are developed. Some of the codes obtained are optimal or almost optimal. The p-ranks of the twin-prime difference sets and a class of almost difference sets are computed.
  • Keywords
    Galois fields; cyclic codes; linear codes; sequences; GF; Galois fields; cyclic codes; linear codes; prime sequences; Communication systems; Consumer electronics; Generators; Linear code; Polynomials; Zinc; $p$ -rank; Almost difference sets; cyclic codes; cyclotomy; difference sets; sequences;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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