2007/12/13 by Hollmann, Henk D. L., Tolhuizen, Ludo M. G. M.
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.0712.2182
In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integers k and n with 1<= k <= n and all fields (in particular, for the binary field). In this note, we answer this question affirmatively by giving two recursive constructions and a direct one.