Linear covering codes and error-correcting codes for limited-magnitude errors

Torleiv Kløve, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


The concepts of a linear covering code and a covering set for the limited-magnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcting codes are also considered for some small-magnitude errors.

Original languageEnglish
Pages (from-to)329-354
Number of pages26
JournalDesigns, Codes, and Cryptography
Issue number2
StatePublished - 1 Jan 2014


  • Covering codes
  • Covering sets
  • Error-correcting codes
  • Limited-magnitude errors
  • Packing sets

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Linear covering codes and error-correcting codes for limited-magnitude errors'. Together they form a unique fingerprint.

Cite this