Optimal codes for correcting a single (wrap-around) burst of errors

Simple item page
dc.creatorHollmann, Henk D. L.
dc.creatorTolhuizen, Ludo M. G. M.
dc.date2007-12-13
dc.date.accessioned2026-07-07T08:49:03Z
dc.date.available2026-07-07T08:49:03Z
dc.descriptionIn 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.
dc.description10 pages; submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/0712.2182
dc.identifierhttp://arxiv.org/abs/0712.2182
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144161
dc.subjectInformation Theory
dc.titleOptimal codes for correcting a single (wrap-around) burst of errors
dc.typetext

Files

Collections

arXiv