AbstractWe propose a new syndrome variety, which can be used to decode cyclic codes. We present also a generalization to erasure and error decoding. We can exhibit a polynomial whose roots give the error locations, once it has been specialized to a given syndrome. This polynomial has degree t in the variable corresponding to the error locations and its coefficients are polynomials in the syndromes
AbstractWe revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. The...
In this paper, a new class of error-correcting linear block codes using symbols from GF(2m) is prese...
It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to...
AbstractWe propose a new syndrome variety, which can be used to decode cyclic codes. We present also...
BCH codes are subclass of cyclic codes with strong properties and have been known for years. In 1994...
AbstractGeneral error locator polynomials are polynomials able to decode any correctable syndrome fo...
A new class of error-locating codes, which are equivalent to cyclic codes, is presented, together wi...
General error locator polynomials were introduced in 2005 as an alternative decoding for cyclic code...
In 1990, Cooper [6, 7] suggested to use Gröbner basis computation in order to deduce error locator ...
AbstractRecently some methods have been proposed to find the distance and weight distribution of cyc...
This research provides ideals of the polynomial ring associated with the code words of a cyclic cod...
General error locator polynomials are polynomials able to decode any correctable syndrome for a give...
For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the erro...
The article addresses the further development of methods of BCH codes norm decoding. The authors pro...
For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error l...
AbstractWe revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. The...
In this paper, a new class of error-correcting linear block codes using symbols from GF(2m) is prese...
It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to...
AbstractWe propose a new syndrome variety, which can be used to decode cyclic codes. We present also...
BCH codes are subclass of cyclic codes with strong properties and have been known for years. In 1994...
AbstractGeneral error locator polynomials are polynomials able to decode any correctable syndrome fo...
A new class of error-locating codes, which are equivalent to cyclic codes, is presented, together wi...
General error locator polynomials were introduced in 2005 as an alternative decoding for cyclic code...
In 1990, Cooper [6, 7] suggested to use Gröbner basis computation in order to deduce error locator ...
AbstractRecently some methods have been proposed to find the distance and weight distribution of cyc...
This research provides ideals of the polynomial ring associated with the code words of a cyclic cod...
General error locator polynomials are polynomials able to decode any correctable syndrome for a give...
For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the erro...
The article addresses the further development of methods of BCH codes norm decoding. The authors pro...
For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error l...
AbstractWe revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. The...
In this paper, a new class of error-correcting linear block codes using symbols from GF(2m) is prese...
It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to...