Burst-Deletion-Correcting Codes for Permutations and Multipermutations

Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei, Xiande Zhang

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Permutation codes and multipermutation codes are widely studied due to various applications in information theory. Designing codes correcting deletion errors has been the main subject of works in the literature and to the best of our knowledge, there exist only optimal codes capable of correcting a single deletion in a permutation. In this paper, we construct several classes of permutation and multipermutation codes that are capable of correcting a burst deletion of length s2, for both stable and unstable models. Efficient error decoders are provided to show the correctness of our constructions.

Original languageEnglish
Article number8790773
Pages (from-to)957-969
Number of pages13
JournalIEEE Transactions on Information Theory
Volume66
Issue number2
DOIs
StatePublished - 1 Feb 2020

Keywords

  • Error-correction codes
  • flash memories
  • multipermutation codes
  • permutation codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Burst-Deletion-Correcting Codes for Permutations and Multipermutations'. Together they form a unique fingerprint.

Cite this