Decomposition of modular codes for computing test sets and Graver basis

DOI10.1007/s11786-012-0120-yzbMath1279.94145OpenAlexW2030765188MaRDI QIDQ1949046

Irene Márquez-Corbella, Edgar Martínez-Moro

Publication date: 25 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-012-0120-y

zbMATH Keywords

Gröbner basistest setsmatroid theoryminimal support codewordscode decompositionsuniversal test sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of commutative algebra (05E40)

Related Items

On the ideal associated to a linear code

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gröbner bases and combinatorics for binary codes
• Implementing gradient descent decoding
• On presentations of subsemigroups of \(\mathbb{N}^n\)
• Construction of set theoretic complete intersections via semigroup gluing
• Algebraic structure of the minimal support codewords set of some linear codes
• The hardness of decoding linear codes with preprocessing
• A Decomposition Theory for Binary Linear Codes
• On a Gröbner bases structure associated to linear codes
• Decoding linear block codes for minimizing word error rate (Corresp.)
• On the foundations of linear and integer linear programming I
• On the inherent intractability of certain coding problems (Corresp.)
• On Minimal Tree Realizations of Linear Codes