Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts
Luis Javier García Villalba, José René Fuentes Cortez, Ana Lucila Sandoval Orozco, Mario Blaum · IEEE Communications Letters · 2011
Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t <; b, are presented, as well as a search algorithm based on syndrome computation for each possible generator polynomial. Previously known results are improved by the new codes.