Permutation codes correcting a single burst deletion I: Unstable deletions

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.