• DocumentCode
    1414664
  • Title

    The covering radius of extremal self-dual code D11 and its application

  • Author

    Tsai, Han-Ping

  • Author_Institution
    Dept. of Math., Soochow Univ., Taipei, Taiwan
  • Volume
    43
  • Issue
    1
  • fYear
    1997
  • fDate
    1/1/1997 12:00:00 AM
  • Firstpage
    316
  • Lastpage
    319
  • Abstract
    D11, constructed by Conway and Sloane, is an extremal self-dual [56,28,12]-code with weight enumerator 1+8190y12+622314y16+11699688y20 +… . We find that the covering radius of D11 is 10. This shows that the inequality R(C56)⩽10 cannot be improved any more, where R(C56) is the covering radius of any extremal doubly even [56,28,12]-code C56 and we use it to get ten new [58,29,10]-codes
  • Keywords
    dual codes; D11 code; covering radius; extremal doubly even code; extremal self-dual code; weight enumerator; Educational institutions; Error correction codes; Geometry; Linear code; Notice of Violation; Welding; World Wide Web;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.567727
  • Filename
    567727
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1414664