• DocumentCode
    1519865
  • Title

    Lower bounds for q-ary covering codes

  • Author

    Chen, Wende ; Honkala, Iiro S.

  • Author_Institution
    Inst. of Syst. Sci., Acad. Sinica, Beijing, China
  • Volume
    36
  • Issue
    3
  • fYear
    1990
  • fDate
    5/1/1990 12:00:00 AM
  • Firstpage
    664
  • Lastpage
    671
  • Abstract
    The authors prove combinatorial lower bounds for Kq (n,R), the minimal cardinality of any q-ary code of length n and covering radius R. Tables of lower bounds for Kq(n,R) are presented for q=3, 4, 5
  • Keywords
    codes; combinatorial mathematics; combinatorial lower bounds; covering radius; minimal cardinality; q-ary covering codes; Error correction codes; Hamming distance; Mathematics; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.54887
  • Filename
    54887
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1519865