On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes

DOI10.1109/TIT.2010.2048454zbMATH Open1366.94637MaRDI QIDQ5281399FDOQ5281399

Authors: José René Fuentes Cortez, Mario Blaum, L. J. García-Villalba 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
• On the existence of optimum cyclic burst- correcting codes
• scientific article; zbMATH DE number 1189045
• Two observations concerning optimum cyclic burst-correcting codes
• Limiting efficiencies of burst-correcting array codes
• On the existence of optimum cyclic burst correcting codes over GF(q)
• scientific article; zbMATH DE number 493098
• On Correcting Bursts (and Random Errors) in Vector Symbol $(n, k)$ Cyclic Codes
• scientific article; zbMATH DE number 3172225
• A class of binary burst error-correcting quasi-cyclic codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Burst-correcting codes (94B20)

Cited In (3)

• On multiple burst-correcting MDS codes
• A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
• Bit Error Rate Minimizing Channel Shortening Equalizers for Cyclic Prefixed Systems

This page was built for publication: On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281399)