Criss-Cross Burst-Deletion Correcting Codes With Optimal Redundancy and En/Decoding Complexity $\mathcal{O}(n^{2})$
- 1 January 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 15509-15521
Abstract
No abstract availableFunding Information
- National Key Research and Development Program of China (2025YFA1017200)
This publication has 24 references indexed in Scilit:
- A Characterization of the DNA Data Storage ChannelScientific Reports, 2019
- Novel combinatorial coding results for DNA sequencing and data storage2017
- List decoding of crisscross error patterns2014
- High dimensional error-correcting codes2010
- Error and erasure correcting algorithms for rank codesDesigns, Codes and Cryptography, 2008
- A new family of optimal codes correcting term rank errors2000
- MDS array codes for correcting a single criss-cross errorIEEE Transactions on Information Theory, 2000
- Probabilistic crisscross error correctionIEEE Transactions on Information Theory, 1997
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Two-dimensional burst identification codes and their use in burst correctionIEEE Transactions on Information Theory, 1988