Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts

Luis Javier García Villalba

doi:10.1109/LCOMM.2011.060111.110338

2011-07-01

PRE

Luis Javier García Villalba *

José René Fuentes Cortez

Ana Lucila Sandoval Orozco

Mario Blaum

DOI：10.1109/LCOMM.2011.060111.110338

原文链接

原文求助

摘要

En 中文

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.

Keyword:

Error-correcting codes

burst errors

shortened cyclic codes

random errors

burst-correcting codes