Algebraic structure of the minimal support codewords set of some linear codes

DOI10.3934/AMC.2011.5.233MaRDI QIDQ2275876zbMATH OpenOpenAlexFDO

Authors Irene Márquez-Corbella, E. Martínez-Moro

Publication date 10 August 2011

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

Full work available at URL https://doi.org/10.3934/amc.2011.5.233

zbMATH Keywords

integer programmingminimal code wordsGröbner basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Integer programming (90C10) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Gröbner bases and combinatorics for binary codes
• Decomposition of modular codes for computing test sets and Graver basis
• A decoding algorithm for binary linear codes using Groebner bases
• On the decoding of cyclic codes using Gröbner bases
• On the ideal associated to a linear code

Cited in

(8)

• Computing Gröbner bases associated with lattices
• On the fan associated to a linear code
• On the weak order ideal associated to linear codes
• Decomposition of modular codes for computing test sets and Graver basis
• Computing coset leaders and leader codewords of binary codes
• Linear label code of a root lattice using Gröbner bases
• On the ideal associated to a linear code
• Heuristic decoding of linear codes using commutative algebra

This page was built for publication: Algebraic structure of the minimal support codewords set of some linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275876)