• DocumentCode
    1254468
  • Title

    Some results on type IV codes over Z4

  • Author

    Bouyuklieva, Stefka

  • Author_Institution
    Dept. of Mediamatics, Delft Univ. of Technol., Netherlands
  • Volume
    48
  • Issue
    3
  • fYear
    2002
  • fDate
    3/1/2002 12:00:00 AM
  • Firstpage
    768
  • Lastpage
    773
  • Abstract
    Dougherty, Gaborit, Harada, Munemasa and Sole (see ibid., vol.45, p.2345-60, 1999) have previously given an upper bound on the minimum Lee weight of a type IV self-dual Z4-code, using a similar bound for the minimum distance of binary doubly even self-dual codes. We improve their bound, finding that the minimum Lee weight of a type IV self-dual Z4-code of length n is at most 4[n/12], except when n=4, and n=8 when the bound is 4, and n=16 when the bound is 8. We prove that the extremal binary doubly even self-dual codes of length n⩾24, n≠32 are not Z4-linear. We classify type IV-I codes of length 16. We prove that all type IV codes of length 24 have minimum Lee weight 4 and minimum Hamming weight 2, and the Euclidean-optimal type IV-I codes of this length have minimum Euclidean weight 8
  • Keywords
    binary codes; dual codes; linear codes; Euclidean-optimal codes; binary doubly even self-dual codes; code length; linear code; minimum Euclidean weight; minimum Hamming weight; minimum Lee weight; minimum distance bound; self-dual code; type IV codes; upper bound; Binary codes; Hamming weight; Informatics; Information technology; Linear code; Mathematics; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.986039
  • Filename
    986039