Delay-Optimal Burst Erasure Code Construction
Emin Martinian, Mitchell Trott · 2007
Delay-optimal burst erasure correction codes have the shortest possible decoding delay required to correct all bursts of a given length with a fixed redundancy. We provide a simple construction that yields linear convolutional delay-optimal burst erasure codes for any choice of coding parameters while keeping the finite field small.