Burst-deletion-correcting codes for permutations and multipermutations

DOI10.1109/TIT.2019.2933819MaRDI QIDQ5211645zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei, Xian De Zhang

Publication date 28 January 2020

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

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

Mathematics Subject Classification ID

Burst-correcting codes (94B20)

Recommendations

• Constructions of multi-permutation codes correcting a single burst of deletions
• On perfect deletion-correcting codes
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• scientific article; zbMATH DE number 5302391
• On multiple insertion/deletion correcting codes

Cited in

(5)

• Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
• Permutations resilient to deletions
• Constructions of multi-permutation codes correcting a single burst of deletions
• Improvements on permutation reconstruction from minors
• Rate-improved multi-permutation codes for correcting a single burst of stable deletions

This page was built for publication: Burst-deletion-correcting codes for permutations and multipermutations

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