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

DOI10.1007/S00200-023-00614-6MaRDI QIDQ6139276zbMATH OpenOpenAlexFDO

Authors Malihe Aliasgari, Daniel Panario, 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

binomial idealGröbner baseslabel codelattice

Mathematics Subject Classification ID

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

Recommendations

• Computing Gröbner bases associated with lattices
• scientific article; zbMATH DE number 5863220
• Linear codes as binomial ideals
• Groebner bases for quaternary codes
• Groebner bases for linear codes over GF(4)

Cites work

• Algebraic algorithms for sampling from conditional distributions
• Algebraic structure of the minimal support codewords set of some linear codes
• Computing generating sets of lattice ideals and Markov bases of lattices
• Computing Gröbner bases associated with lattices
• Density/length profiles and trellis complexity of lattices
• Gröbner bases and combinatorics for binary codes
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Gröbner representations of binary matroids
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• Low-Density Parity-Check Lattices: Construction and Decoding Analysis
• Tanner graphs for group block codes and lattices: construction and complexity
• Trellis complexity versus the coding gain of lattices. I
• Trellis complexity versus the coding gain of lattices. II

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

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