Citation
Abstract
We make the simple observation that the erasure burst correction capability of any (n,k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(pJ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasure protection with linear complexity, and that the optimality does not depend on the length of the code.
Keywords
block interleaving
burst erasure correction capability
MDS codes
Details
- Volume
- 42-174
- Published
- August 15, 2008
- Pages
- 1–17
- File Size
- 431.1 KB