• DocumentCode
    1029836
  • Title

    Linear inequalities for covering codes. II. Triple covering inequalities

  • Author

    Zhang, Zhen ; Lo, Chiaming

  • Author_Institution
    Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA
  • Volume
    38
  • Issue
    6
  • fYear
    1992
  • fDate
    11/1/1992 12:00:00 AM
  • Firstpage
    1648
  • Lastpage
    1662
  • Abstract
    For Pt.I, see ibid., vol.37, no.3, p.573-82 (May 1991). The linear inequality method for covering codes is generalized. This method reduces the study of covering codes to the study of some local covering problems. One of these problems, the 1-3 covering system, is formulated and studied in detail. The results for this local covering problem lead to new linear inequalities satisfied by covering codes, which are used to obtain numerous new lower bounds on K(n, R) and t[n, k]
  • Keywords
    error correction codes; covering codes; linear inequality method; local covering problem; lower bounds; triple covering inequalities; Binary codes; Binary sequences; Combinatorial mathematics; Equations; Error correction codes; Linear code; Linear matrix inequalities;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.165440
  • Filename
    165440
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1029836