Abstract
In this paper, some properties of maximum-distance separable linear codes are presented. Based on these properties, a decoding algorithm for correcting random errors is established. A simpler decoding algorithm for correcting burst errors is also given. Applying these decoding algorithms to known classes of maximum-distance separable linear codes, the amount of hardware required for implementation is only a small fraction of those required by the existing decoding algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 487-491 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 17 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 1971 |
| Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences