Pseudo-MDP Convolutional Codes for Burst Erasure Correction
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910072576147456 |
|---|---|
| author | Abreu, Zita Lieb, Julia Pinto, Raquel |
| author_facet | Abreu, Zita Lieb, Julia Pinto, Raquel |
| contents | Convolutional codes are a class of error-correcting codes that performs very well over erasure channels with low delay requirements. In particular, Maximum Distance Profile (MDP) convolutional codes, which are defined to have optimal column distances, are able to correct a maximal number of erasures in decoding windows of fixed sizes. However, the required field size in the known constructions for MDP convolutional codes increases rapidly with the code parameters. On the other hand, if the code parameters are small, larger bursts of erasures cannot be corrected. In this paper, we present a new class of convolutional codes, which we call Pseudo-MDP convolutional codes. By definition these codes can correct large bursts of erasures within a prescribed time-delay and still keep part of the advantageous properties of MDP convolutional codes, in the sense that we require some but not all column distances to be optimal. This release in the condition on the column distances allows us to construct Pseudo-MDP convolutional codes over fields of smaller size than those required for MDP convolutional codes with the same code parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_24516 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Pseudo-MDP Convolutional Codes for Burst Erasure Correction Abreu, Zita Lieb, Julia Pinto, Raquel Information Theory Convolutional codes are a class of error-correcting codes that performs very well over erasure channels with low delay requirements. In particular, Maximum Distance Profile (MDP) convolutional codes, which are defined to have optimal column distances, are able to correct a maximal number of erasures in decoding windows of fixed sizes. However, the required field size in the known constructions for MDP convolutional codes increases rapidly with the code parameters. On the other hand, if the code parameters are small, larger bursts of erasures cannot be corrected. In this paper, we present a new class of convolutional codes, which we call Pseudo-MDP convolutional codes. By definition these codes can correct large bursts of erasures within a prescribed time-delay and still keep part of the advantageous properties of MDP convolutional codes, in the sense that we require some but not all column distances to be optimal. This release in the condition on the column distances allows us to construct Pseudo-MDP convolutional codes over fields of smaller size than those required for MDP convolutional codes with the same code parameters. |
| title | Pseudo-MDP Convolutional Codes for Burst Erasure Correction |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.24516 |