Abstract
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 language | English |
|---|---|
| Pages (from-to) | 329-354 |
| Number of pages | 26 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 73 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jan 2014 |
Keywords
- Covering codes
- Covering sets
- Error-correcting codes
- Limited-magnitude errors
- Packing sets
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics