Prefactor Reduction of the Guruswami–Sudan Interpolation Step

DOI10.1109/TIT.2014.2361347MaRDI QIDQ2979141zbMATH OpenFDO

Authors Christian Senger

Publication date 2 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.7901

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: The concept of prefactors is considered in order to decrease the complexity of the Guruswami-Sudan interpolation step for generalized Reed-Solomon codes. It is shown that the well-known re-encoding projection due to Koetter et al. leads to one type of such prefactors. The new type of Sierpinski prefactors is introduced. The latter are based on the fact that many binomial coefficients in the Hasse derivative associated with the Guruswami-Sudan interpolation step are zero modulo the base field characteristic. It is shown that both types of prefactors can be combined and how arbitrary prefactors can be used to derive a reduced Guruswami-Sudan interpolation step.

This page was built for publication: Prefactor Reduction of the Guruswami–Sudan Interpolation Step

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979141)