Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension 2 Over Prime Fields

DOI10.1109/TIT.2007.896889MaRDI QIDQ3548865zbMATH OpenOpenAlexFDO

Authors L. F. McAven, Reihaneh Safavi-Naini

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60) Synchronization error-correcting codes (94B50)

Recommendations

• scientific article; zbMATH DE number 2127884
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
• scientific article; zbMATH DE number 5302391

Cited in

(5)

• scientific article; zbMATH DE number 2127884 (Why is no real title available?)
• New dimension-independent upper bounds on linear insdel codes
• On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• Insdel codes from subspace and rank-metric codes

This page was built for publication: Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension $2$ Over Prime Fields

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