• DocumentCode
    774477
  • Title

    Cubic self-dual binary codes

  • Author

    Bonnecaze, Alexis ; Bracco, Anne Desideri ; Dougherty, Steven T. ; Nochefranca, Luz R. ; Solé, Patrick

  • Volume
    49
  • Issue
    9
  • fYear
    2003
  • Firstpage
    2253
  • Lastpage
    2258
  • Abstract
    We study binary self-dual codes with a fixed point free automorphism of order three. All binary codes of that type can be obtained by a cubic construction that generalizes Turyn\´s. We regard such "cubic" codes of length 3ℓ as codes of length ℓ over the ring F2×F4. Classical notions of Type II codes, shadow codes, and weight enumerators are adapted to that ring. Two infinite families of cubic codes are introduced. New extremal binary codes in lengths ≤ 66 are constructed by a randomized algorithm. Necessary conditions for the existence of a cubic [72,36,16] Type II code are derived.
  • Keywords
    Reed-Muller codes; binary codes; dual codes; residue codes; Reed-Muller codes; Type II codes; code length; cubic self-dual binary codes; extremal binary codes; fixed point free automorphism; necessary conditions; quadratic residue codes; randomized algorithm; shadow codes; weight enumerators; Binary codes; Cities and towns; Hamming distance; Hamming weight; Mathematics; Writing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.815800
  • Filename
    1226612