On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes

DOI10.1109/TIT.2008.917721zbMATH Open1328.94092MaRDI QIDQ3604476FDOQ3604476

John J. Metzner

Publication date: 24 February 2009

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

zbMATH Keywords

cyclic codesburst error correctionvector symbol decoding

Mathematics Subject Classification ID

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

Cited In (4)

• Simultaneous Error-Correction and Burst-Error Detection Using Binary Linear Cyclic Codes
• On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes
• Title not available (Why is that?)
• A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes

   Recommendations

• Title not available (Why is that?) 👍 👎
• Multiple-burst error-correcting cyclic product codes (Corresp.) 👍 👎
• Title not available (Why is that?) 👍 👎
• Multiple-burst-error correction by threshold decoding 👍 👎
• Two observations concerning optimum cyclic burst-correcting codes 👍 👎

This page was built for publication: On Correcting Bursts (and Random Errors) in Vector Symbol $(n, k)$ Cyclic Codes

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