On the ideal associated to a linear code

DOI10.3934/amc.2016003zbMath1402.94091arXiv1206.5124OpenAlexW3023981783MaRDI QIDQ326292

Edgar Martínez-Moro, Irene Márquez-Corbella, Emilio Suárez-Canedo

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basesGraver basesminimal support codewords

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) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items

Characteristic vector and weight distribution of a linear code ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ Heuristic decoding of linear codes using commutative algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gröbner bases and combinatorics for binary codes
• Implementing gradient descent decoding
• A Gröbner basis technique for Padé approximation
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Solving a multivariable congruence by change of term order
• Binomial ideals
• Decomposition of modular codes for computing test sets and Graver basis
• Algebraic structure of the minimal support codewords set of some linear codes
• The hardness of decoding linear codes with preprocessing
• On the inherent intractability of certain coding problems (Corresp.)
• Minimal vectors in linear codes
• An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms