Linear label code of a root lattice using Gröbner bases

DOI10.1007/s00200-023-00614-6OpenAlexW4385296592MaRDI QIDQ6139276

Daniel Panario, Malihe Aliasgari, Mohammad-Reza Sadeghi

Publication date: 18 January 2024

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-023-00614-6

zbMATH Keywords

latticeGröbner basesbinomial ideallabel code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Lattice packing and covering (number-theoretic aspects) (11H31) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Cites Work

• Unnamed Item
• Computing Gröbner bases associated with lattices
• Computing generating sets of lattice ideals and Markov bases of lattices
• Gröbner bases and combinatorics for binary codes
• Algebraic algorithms for sampling from conditional distributions
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Algebraic structure of the minimal support codewords set of some linear codes
• Trellis complexity versus the coding gain of lattices. I
• Trellis complexity versus the coding gain of lattices. II
• Low-Density Parity-Check Lattices: Construction and Decoding Analysis
• Gröbner Representations of Binary Matroids
• Tanner graphs for group block codes and lattices: construction and complexity
• Density/length profiles and trellis complexity of lattices

This page was built for publication: Linear label code of a root lattice using Gröbner bases