The simple roots problem - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the Romanian Academy, Series A Year : 2017

The simple roots problem

Abstract

The simple roots problem is a natural question related to the structure of the error locator polynomial, which is one of the key objects in the decoding algorithms for Alternant codes. Finding the roots of this polynomial enables the error positions and thus the decoding solution for this family of codes. Hence, we propose here to study the structure of the error locator polynomial, denoted σ(x). We prove that when the degree of σ(x) is sub-linear in the length of the code, the probability that all the coefficients of σ(x) are different from zero is extremely high.
Fichier principal
Vignette du fichier
Simple_roots_rcd_1.pdf (442.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01598419 , version 1 (04-10-2017)

Identifiers

  • HAL Id : hal-01598419 , version 1

Cite

Dominic Bucerzan, Vlad Dragoi, Tania Richmond. The simple roots problem. Proceedings of the Romanian Academy, Series A, 2017, Volume 18 (Special issue 2017, Cryptology Science), pp. 317-332. ⟨hal-01598419⟩
352 View
85 Download

Share

Gmail Facebook Twitter LinkedIn More