Institute of Mathematics


Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

Half error locator polynomials for efficient decoding of binary cyclic codes

Dr. Michela Ceria talk

Date: 11.12.19  Time: 15.00 - 16.00  Room:

In 1990 Cooper suggested to use Groebner bases’ computations to decode cyclic codes and his idea gave rise to many research papers. In particular, as proved by Sala-Orsini, once defined the polynomial ring whose variables are the syndromes, the locations and the error values and considered the syndrome ideal, only one polynomial of a lexicographical Groebner basis for such ideal is necessary to decode (the general error locator polynomial - GELP). The decoding procedure only consists in evaluating this polynomial in the syndromes and computing its roots: the roots are indeed the error locations. A possible bottleneck in this procedure may be the evaluation part, since a priori the GELP may be dense. In this talk, focusing on binary cyclic codes with length n | 2^m − 1, correcting up to two errors, we give a Groebner-free, sparse analog of the GELP, the half error locator polynomial (HELP). In particular, we show that it is not necessary to compute the whole Groebner basis for getting such kind of locator polynomial and we construct the HELP, studying the quotient algebra of the polynomial ring modulo the syndrome ideal by a combinatorial point of view. The HELP turns out to have linear growth in the length n of the code: O((n+1)/2).