In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best (shortened) cyclic burst-correcting codes is presented. Using this algorithm, extensive tables that either tie existing constructions or improve them are obtained for burst lengths up to b=10.
@article{arxiv.1101.5411,
title = {Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes},
author = {Luis Javier García Villalba and José René Fuentes Cortez and Ana Lucila Sandoval Orozco and Mario Blaum},
journal= {arXiv preprint arXiv:1101.5411},
year = {2011}
}