On a Gröbner bases structure associated to linear codes

DOI10.1080/09720529.2007.10698114zbMath1172.94632arXivmath/0506045OpenAlexW2094272047MaRDI QIDQ3637823

Miguel Angel Borges-Trenard, Edgar Martínez-Moro, Mijail Borges-Quintana

Publication date: 14 July 2009

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0506045

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

On the weak order ideal associated to linear codes ⋮ On the Fan Associated to a Linear Code ⋮ Computing Gröbner bases associated with lattices ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ Trial Set and Gröbner Bases for Binary Codes ⋮ Gröbner bases and combinatorics for binary codes ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Computing coset leaders and leader codewords of binary codes ⋮ Computing an Invariant of a Linear Code ⋮ Heuristic decoding of linear codes using commutative algebra

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Computing Gröbner bases by FGLM techniques in a non-commutative setting
• Classifying subspaces of Hamming spaces
• Polynomial algorithms in computer algebra
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• The hardness of decoding linear codes with preprocessing
• Is code equivalence easy to decide?
• Finding the permutation between equivalent linear codes: the support splitting algorithm