Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes

In a previous work [5] 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 algorithm that optimizes the search for the best (shortened) cyclic burst-correcting codes is presented. The use of Gray codes in the algorithm optimizes the search, in the sense that no repeated syndromes are computed. © 2011 IEEE.