List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes
Saved in:
| Title: | List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes |
|---|---|
| Authors: | Bartz, Hannes |
| Contributors: | Institute for Communications Engineering, Technische Universität Munchen - Technical University Munich - Université Technique de Munich (TUM), Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia |
| Source: | WCC2015 - 9th International Workshop on Coding and Cryptography 2015 ; https://inria.hal.science/hal-01276220 ; WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France ; wcc2015.inria.f |
| Publisher Information: | HAL CCSD |
| Publication Year: | 2015 |
| Collection: | Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
| Subject Terms: | [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] |
| Subject Geographic: | Paris, France |
| Description: | International audience ; An efficient interpolation-based decoding algorithm for folded Gabidulin codes is presented that can correct rank errors beyond half the minimum rank distance for any code rate R ∈ [0, 1]. The algorithm serves as a list decoder or as a probabilistic unique decoder and improves upon existing schemes, especially for high code rates. A probabilistic unique decoder with adjustable decoding radius is presented. The de-coder outputs a unique solution with high probability and requires at most O(s^2 n^2) operations in Fqm , where s is a decoding parameter and n is the length of the unfolded code. An upper bound on the average list size and on the decoding failure probability of the decoder is given. |
| Document Type: | conference object |
| Language: | English |
| Relation: | hal-01276220; https://inria.hal.science/hal-01276220; https://inria.hal.science/hal-01276220/document; https://inria.hal.science/hal-01276220/file/wcc15-tu2-4.pdf |
| Availability: | https://inria.hal.science/hal-01276220 https://inria.hal.science/hal-01276220/document https://inria.hal.science/hal-01276220/file/wcc15-tu2-4.pdf |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Accession Number: | edsbas.BB455697 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | International audience ; An efficient interpolation-based decoding algorithm for folded Gabidulin codes is presented that can correct rank errors beyond half the minimum rank distance for any code rate R ∈ [0, 1]. The algorithm serves as a list decoder or as a probabilistic unique decoder and improves upon existing schemes, especially for high code rates. A probabilistic unique decoder with adjustable decoding radius is presented. The de-coder outputs a unique solution with high probability and requires at most O(s^2 n^2) operations in Fqm , where s is a decoding parameter and n is the length of the unfolded code. An upper bound on the average list size and on the decoding failure probability of the decoder is given. |
|---|