Abstract
For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of l-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity O(l 2) where U measures the size of the input problem.
| Original language | English |
|---|---|
| Publication date | 2015 |
| Number of pages | 10 |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | 9th International Workshop on Coding and Cryptography (WCC 2015) - Paris, France Duration: 13 Apr 2015 → 17 Apr 2015 Conference number: 9 http://wcc2015.inria.fr/ |
Conference
| Conference | 9th International Workshop on Coding and Cryptography (WCC 2015) |
|---|---|
| Number | 9 |
| Country/Territory | France |
| City | Paris |
| Period | 13/04/2015 → 17/04/2015 |
| Other | Organized by INRIA |
| Internet address |
Keywords
- Skew Polynomials
- Ore Polynomials
- Shift Register Synthesis
- Module Minimisation
- Gabidulin Codes
Fingerprint
Dive into the research topics of 'Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver