• DocumentCode
    969374
  • Title

    Some new lower bounds for binary and ternary covering codes

  • Author

    van Wee, G.J.M.

  • Author_Institution
    Philips Res. Lab., Eindhoven, Netherlands
  • Volume
    39
  • Issue
    4
  • fYear
    1993
  • fDate
    7/1/1993 12:00:00 AM
  • Firstpage
    1422
  • Lastpage
    1424
  • Abstract
    A modified lower bound for binary codes with covering radius one is derived. Let Kq(n,R) denote the minimum cardinality of a q-ary code with covering radius R . The new bound shows that K2(11,1)⩾177 and that K2(17,1)⩾7391, improvements of the best lower bounds known. The authors also generalize a known lower bound for binary codes to the case of arbitrary q. For q=3, this simple bound improves the best lower bounds known in several cases. An updated version of a table for K3(n,R ) is included
  • Keywords
    codes; binary covering codes; covering radius; lower bounds; minimum cardinality; q-ary code; ternary covering codes; Binary codes; Error correction codes; Upper bound; Zirconium;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.243462
  • Filename
    243462
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=969374