Recursive decoding of projective Reed-Muller codes
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910033953947648 |
|---|---|
| author | San-José, Rodrigo |
| author_facet | San-José, Rodrigo |
| contents | We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of projective Reed-Muller codes. We show when we can decode up to the error correction capability of these codes, and we compute the order of complexity of the algorithm, which is given by that of the chosen decoder for affine Reed-Muller codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_01692 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Recursive decoding of projective Reed-Muller codes San-José, Rodrigo Information Theory 94B35 (Primary) 94B05, 11T71 (Secondary) We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of projective Reed-Muller codes. We show when we can decode up to the error correction capability of these codes, and we compute the order of complexity of the algorithm, which is given by that of the chosen decoder for affine Reed-Muller codes. |
| title | Recursive decoding of projective Reed-Muller codes |
| topic | Information Theory 94B35 (Primary) 94B05, 11T71 (Secondary) |
| url | https://arxiv.org/abs/2501.01692 |