Computing Gröbner bases associated with lattices

DOI10.3934/amc.2016045zbMath1407.13025MaRDI QIDQ340181

Daniel Panario, Ismara Álvarez-Barrientos, Mijail Borges-Quintana, Miguel Angel Borges-Trenard

Publication date: 11 November 2016

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

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

zbMATH Keywords

Gröbner bases; group codes; lattices; label codes; Möller algorithm

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

14G50: Applications to coding theory and cryptography of arithmetic geometry

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gröbner bases and combinatorics for binary codes
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Computing Gröbner bases by FGLM techniques in a non-commutative setting
• Algebraic structure of the minimal support codewords set of some linear codes
• On a Gröbner bases structure associated to linear codes
• The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
• Tanner graphs for group block codes and lattices: construction and complexity
• Trellis complexity and minimal trellis diagrams of lattices
• Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm