most citedGroebner bases and combinatorics for binary codes

4 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

math.AC2005

A general framework for applying FGLM techniques to linear codes

M. Borges-Quintana, M. A. Borges-Trenard, E. Martinez-Moro

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…

math.CO20054 cited

Groebner bases and combinatorics for binary codes

M. Borges-Quintana, M. A. Borges-Trenard, P. Fitzpatrick +1

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gröbner basis of this ideal with respect to a total degree ordering…

math.AC2005

On a Grobner bases structure associated to linear codes

M. Borges-Quintana, M. Borges-Trenard, E. Martinez-Moro

We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework…

math.CO2005

Multivariable codes over finite chain rings: semisimple codes

E. Martinez-Moro, I. F. Rua

The structure of multivariate semisimple codes over a finite chain ring is established using the structure of the residue field . Multivariate codes extend in a natural…

math.CO2001

Properties of Commutative Association Schemes derived by FGLM Techniques

Edgar Martinez-Moro

Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and…