• DocumentCode
    851176
  • Title

    On the covering radius of subcodes of a code

  • Author

    Hou, Xiang-Dong

  • Author_Institution
    Dept. of Math. & Stat., Wright State Univ., Dayton, OH, USA
  • Volume
    37
  • Issue
    6
  • fYear
    1991
  • fDate
    11/1/1991 12:00:00 AM
  • Firstpage
    1706
  • Lastpage
    1707
  • Abstract
    Let C be a binary linear code with covering radius R , and C0 a subcode of C of codimension i. An upper bound is obtained for the covering radius of C 0 in terms of R and i. When C 0 ={0}, the bound becomes the sphere covering bound for R
  • Keywords
    codes; binary linear code; codimension; covering radius; sphere covering bound; subcodes; upper bound; Equations; Linear code; Parity check codes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.104338
  • Filename
    104338
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=851176