• DocumentCode
    1319113
  • Title

    Improved binary codes and sequence families from Z4-linear codes

  • Author

    Shanbhag, Abhijit G. ; Kumar, P. Vijay ; Hellesath, T.

  • Author_Institution
    Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
  • Volume
    42
  • Issue
    5
  • fYear
    1996
  • fDate
    9/1/1996 12:00:00 AM
  • Firstpage
    1582
  • Lastpage
    1587
  • Abstract
    A bound on exponential sums over Galois rings is used to construct a nested chain of Z4-linear binary codes and binary sequences. When compared with the chain of Delsarte-Goethals´(1975) codes, the codes in the new chain offer a larger minimum distance for the same code size. The binary sequence families constructed also make use of Nechaev´s (1991) construction of a cyclic version of the Kerdock code. For a given value of maximum correlation, the binary sequences are shown to have a family size considerably larger than the best sequence families known
  • Keywords
    binary sequences; correlation methods; cyclic codes; linear codes; Galois rings; Kerdock code; Z4-linear codes; binary codes; binary sequence families; code size; cyclic codes; exponential sums bound; family size; maximum correlation; minimum distance; nested chain; Binary codes; Binary sequences; Councils; Gold; Informatics; Information theory; Multiaccess communication;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.532904
  • Filename
    532904
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1319113