2013/09/30 by Christian Senger, Senger, Christian
Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1309.7901
13 pages, 3 figures
openalex publication_date 2013/09/30 · arxiv created 2013/10/29 · arxiv updated 2013/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.