Abstract
Conference Title: 2017 IEEE International Symposium on Information Theory (ISIT) Conference Start Date: 2017, June 25 Conference End Date: 2017, June 30 Conference Location: Aachen, Germany 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.