Burst-Deletion-Correcting Codes for Permutations and Multipermutations

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

doi:10.1109/TIT.2019.2933819

Burst-Deletion-Correcting Codes for Permutations and Multipermutations

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

Department of Electrical & Computer Engineering

Research output: Contribution to journal › Article › peer-review

7 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 language	English
Article number	8790773
Pages (from-to)	957-969
Number of pages	13
Journal	IEEE Transactions on Information Theory
Volume	66
Issue number	2
DOIs	https://doi.org/10.1109/TIT.2019.2933819
State	Published - 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

Access to Document

10.1109/TIT.2019.2933819

Cite this

@article{1038a5ce668645b489232afa87224dce,

title = "Burst-Deletion-Correcting Codes for Permutations and Multipermutations",

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.",

keywords = "Error-correction codes, flash memories, multipermutation codes, permutation codes",

author = "Chee, {Yeow Meng} and San Ling and Nguyen, {Tuan Thanh} and Vu, {Van Khu} and Hengjia Wei and Xiande Zhang",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2020",

month = feb,

day = "1",

doi = "10.1109/TIT.2019.2933819",

language = "English",

volume = "66",

pages = "957--969",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - Burst-Deletion-Correcting Codes for Permutations and Multipermutations

AU - Chee, Yeow Meng

AU - Ling, San

AU - Nguyen, Tuan Thanh

AU - Vu, Van Khu

AU - Wei, Hengjia

AU - Zhang, Xiande

PY - 2020/2/1

Y1 - 2020/2/1

N2 - 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.

AB - 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.

KW - Error-correction codes

KW - flash memories

KW - multipermutation codes

KW - permutation codes

UR - http://www.scopus.com/inward/record.url?scp=85078522898&partnerID=8YFLogxK

U2 - 10.1109/TIT.2019.2933819

DO - 10.1109/TIT.2019.2933819

M3 - Article

AN - SCOPUS:85078522898

SN - 0018-9448

VL - 66

SP - 957

EP - 969

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

M1 - 8790773

ER -

Burst-Deletion-Correcting Codes for Permutations and Multipermutations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this