Efficient Algorithms for Searching Optimal Shortened Cyclic   Single-Burst-Correcting Codes
  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. 
Luis Javier Garc\'ia Villalba, Jos\'e Ren\'e Fuentes Cortez, Ana   Lucila Sandoval Orozco and Mario Blaum
cs.DM