@inproceedings{5a40ed4e1dd145e5b91386ba043e2bdb,
title = "Permutation codes correcting a single burst deletion II: Stable deletions",
abstract = "We construct permutation codes capable of correcting bursts of stable deletions. For correcting a single burst of exactly s stable deletions, our code has size sn!/((2s)!n)2 while the upper bound is n!/s!(n - s + 1). We also construct permutation codes for the cases of single burst of up to s stable deletions, and up to b bursts of at most s stable deletions each.",
author = "Chee, \{Yeow Meng\} and San Ling and Nguyen, \{Tuan Thanh\} and Vu, \{Van Khu\} and Hengjia Wei",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8007017",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "2688--2692",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "United States",
}