Constructions of Multi-Permutation Codes Correcting at Most <i>t</i> Bursts of Stable Deletions

Permutation codes and multi-permutation codes have attracted considerable attention owing to their promising applications in data storage systems, such as flash memories. By leveraging the interleaving of multiple t-deletion-correcting permutation codes, we present a novel construction of multi-permutation codes capable of correcting at most t bursts of stable deletions, where each burst has a length of exactly s for t > 1 and s > 1. The proposed construction is proved to incorporate decoding methods and is further validated through illustrative examples.