An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes
Luis Javier García Villalba, José René Fuentes Cortez, Ana Lucila Sandoval Orozco, Mario Blaum · IEEE Communications Letters · 2011
An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes.