Limiting efficiencies of burst-correcting array codes

DOI10.1109/18.86991MaRDI QIDQ3360803zbMATH OpenOpenAlexFDO

Authors Zhen Zhang

Publication date 1991

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

Full work available at URL https://doi.org/10.1109/18.86991

zbMATH Keywords

burst errorsburst- correcting array codescyclic codesefficiencyerror-correcting codesproduct codes

Mathematics Subject Classification ID

Burst-correcting codes (94B20)

Recommendations

• A family of efficient burst-correcting array codes
• Multiple burst-correcting array codes
• Burst error correction capability of square array codes
• A class of burst error-correcting array codes (Corresp.)
• The burst error correcting capabilities of a simple array code

Cited in

(6)

• Weakly biased arrays, almost independent arrays and error-correcting codes
• A family of efficient burst-correcting array codes
• A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
• On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes
• Limitations on Testable Affine-Invariant Codes in the High-Rate Regime
• Bursts in \(m\)-metric array codes

This page was built for publication: Limiting efficiencies of burst-correcting array codes

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