Abstract
We construct the first class of permutation codes that are capable of correcting a burst of up to s unstable deletions, for general s. Efficient decoding algorithms are presented to show the correctness of our constructions.
- Title
- Permutation Codes Correcting a Single Burst Deletion I: Unstable Deletions
- Creators - without role
- Yeow Meng Chee - Supreme Council Of HealthVan Khu Vu - Supreme Council Of HealthXiande Zhang - Supreme Council Of HealthIEEE
- Publication Details
- 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.1741-1745
- Series
- IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Number of pages
- 5
- Identifiers
- 9911183109846
- Academic Unit
- ISTD Pillar; ESD Pillar; Office of Provost
- Language
- English
- Resource Type
- Conference proceeding