| GRACE |  |
Conference papers
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation
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*mu^2) where mu measures the size of the input problem.
Cited literature [27 references]
https://hal.inria.fr/hal-01245068
Contributor : Johan S. R. Nielsen Connect in order to contact the contributor
Submitted on : Wednesday, December 16, 2015 - 4:08:24 PM
Last modification on : Monday, July 26, 2021 - 11:06:59 AM
Long-term archiving on: : Saturday, April 29, 2017 - 4:55:10 PM
Contributor : Johan S. R. Nielsen Connect in order to contact the contributor
Submitted on : Wednesday, December 16, 2015 - 4:08:24 PM
Last modification on : Monday, July 26, 2021 - 11:06:59 AM
Long-term archiving on: : Saturday, April 29, 2017 - 4:55:10 PM
File
2015_wcc_skew_module.pdf
Files produced by the author(s)