Back to Search
Start Over
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation
- Publication Year :
- 2015
-
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 $\ell$-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity $O(\ell \mu^2)$ where $\mu$ measures the size of the input problem.<br />Comment: 10 pages, submitted to WCC 2015
- Subjects :
- Computer Science - Information Theory
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1501.04797
- Document Type :
- Working Paper