Abstract
A family of binary array codes of size (p - 1) × n, p a prime, correcting multiple column erasures is proposed. The codes coincide with a subclass of shortened Reed-Solomon codes and achieve the maximum possible correcting capability. Complexity of encoding and decoding is proportional to rnp, where r is the number of correctable erasures, i.e., is simpler than the Forney decoding algorithm. The length n of the codes is at most 2p - 1, that is, twice as big as the length of the Blaum-Roth codes having comparable decoding complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 1843-1851 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 43 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1997 |
| Externally published | Yes |
Keywords
- Array codes
- Burst correction
- Decoding
- Erasures correction
- Reed-Solomon codes