A general framework for applying FGLM techniques to linear codes

Authors:
M. Borges-Quintana;M. A. Borges-Trenard;E. Martínez-Moro
Affiliations:
Dpto. de Matemática, FCMC, U. de Oriente, Santiago de Cuba, Cuba;Dpto. de Matemática, FCMC, U. de Oriente, Santiago de Cuba, Cuba;Dpto. de Matemática Aplicada, U. de Valladolid, Spain
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 5
Cited 2

Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Computing Gröbner bases by FGLM techniques in a non-commutative setting

Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
The Construction of Multivariate Polynomials with Preassigned Zeros

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Gröbner bases and combinatorics for binary codes

Applicable Algebra in Engineering, Communication and Computing
Computing zero-dimensional schemes

Journal of Symbolic Computation

Gröbner Representations of Binary Matroids

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Bounded distance decoding of linear error-correcting codes with Gröbner bases

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show herein that a pattern based on FGLM techniques can be used for computing Gröbner bases, or related structures, associated to linear codes. This Gröbner bases setting turns out to be strongly related to the combinatorics of the codes.