Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation - GRACE Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
2015_wcc_skew_module.pdf (445.6 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01245068 , version 1 (16-12-2015)

Identifiers

Cite

W Li, Johan Sebastian Rosenkilde Nielsen, S Puchinger, V Sidorenko. Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01245068⟩
316 View
120 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More