Correcting Deletions Using Linear and Cyclic Codes

DOI10.1109/TIT.2010.2059790MaRDI QIDQ5281272zbMATH OpenFDO

Authors Khaled Abdel-Ghaffar, Hendrik C. Ferreira, Ling Cheng

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Burst-correcting codes (94B20) Synchronization error-correcting codes (94B50)

Cited in

(6)

• Deletion correcting codes meet the Littlewood-Offord problem
• Construction of single-deletion-correcting DNA codes using CIS codes
• scientific article; zbMATH DE number 605666 (Why is no real title available?)
• Insdel codes from subspace and rank-metric codes
• New dimension-independent upper bounds on linear insdel codes
• Optimal insdel codes from almost MDS codes

This page was built for publication: Correcting Deletions Using Linear and Cyclic Codes

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