On the efficiency of shortened cyclic single-burst-correcting codes

Shortened cyclic codes that are capable of correcting up to a single burst of errors are considered. The efficiency of such codes has been analized by how well they approximate the Reiger bound, i.e., by the burst-correcting efficiency of the code. Although the efficiency is still an important parameter, it is shown that this one is not necessarily the most important consideration when choosing a single-burst-correcting code. It is shown that in some natural practical applications (like in a Gilbert

• Type: Journal
• Year: 2010
• Where: TIT
• Authors: Luis Javier García-Villalba, José René Fuentes Cortez, Mario Blaum
• Keywords: Code, Cyclic Codes, Education, Natural Practical Applications, TIT 2010