Work

Constructions of Multi-Permutation Codes Correcting at Most t Bursts of Stable Deletions

Year: 2025

Type: article

Abstract: 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.

Source: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

DOI: 10.1587/transfun.2025eal2041

Authors: Peng ZHAO, Jianjun MU, Hui HAN

Institutions: Xinyang Normal University, Xidian University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: Xinyang Normal University, Nanhu Scholars Program for Young Scholars of Xinyang Normal University

OpenAlex ID: W4413922069

FWCI:

Cites:

Cited by:

Related to: 10