• DocumentCode
    1319149
  • Title

    On the weight hierarchy of Kerdock codes over Z4

  • Author

    Yang, Kyeongcheol ; Helleseth, Tor ; Kumar, P.V. ; Shanbhag, Abhijit G.

  • Author_Institution
    Dept. of Electron. Commun. Eng., Hanyang Univ., Seoul, South Korea
  • Volume
    42
  • Issue
    5
  • fYear
    1996
  • fDate
    9/1/1996 12:00:00 AM
  • Firstpage
    1587
  • Lastpage
    1593
  • Abstract
    The rth generalized Hamming weight dr of the Kerdock code of length 2m over Z4 is considered. A lower bound on dr is derived for any r, and dr is exactly determined for r=0.5, 1, 1.5, 2, 2.5. In the case of length 2 2m, dr is determined for any r, where 0⩽r⩽m and 2r is an integer. In addition, it is shown that it is sometimes possible to determine the generalized Hamming weights of the Kerdock codes of larger length using the results of dr for a given length. The authors also provide a closed-form expression for the Lee weight of a Kerdock codeword in terms of the coefficients in its trace expansion
  • Keywords
    linear codes; Kerdock codes; Kerdock codeword; closed form expression; code length; generalized Hamming weight; linear code; lower bound; trace expansion coefficients; weight hierarchy; Computer science; Error correction codes; Gold; Hamming weight; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.532905
  • Filename
    532905
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1319149