• DocumentCode
    1256872
  • Title

    Upper bounds for q-ary covering codes

  • Author

    Ostergard, Patric R J

  • Author_Institution
    Digital Syst. Lab., Helsinki Univ. of Technol., Espoo, Finland
  • Volume
    37
  • Issue
    3
  • fYear
    1991
  • fDate
    5/1/1991 12:00:00 AM
  • Firstpage
    660
  • Lastpage
    664
  • Abstract
    New methods for constructing q-ary covering codes are presented. The author introduces the concepts of (p-) seminormal and strongly (p-) seminormal codes and shows how seminormal codes and punctured Hamming codes can be combined to construct new covering codes. Using these methods, upper bounds for ternary covering codes are improved. The new bounds are K3
  • Keywords
    codes; punctured Hamming codes; q-ary covering codes; seminormal codes; ternary covering codes; upper bounds; Binary codes; Communication system control; Error correction codes; Feedback; Galois fields; Information theory; Memoryless systems; Notice of Violation; Reliability theory; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.79926
  • Filename
    79926
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1256872