Groebner bases for quaternary codes

MaRDI QIDQ2879674zbMATH OpenFDO

Authors Robert Leppert, Mehwish Saleemi, Karl-Heinz Zimmermann

Publication date 29 March 2012

Published in International Journal of Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.ijpam.eu/contents/2011-71-4/7/index.html

zbMATH Keywords

binomial idealGroebner basislinear codenonprime idealpolynomial ringquaternary codestoric ideal

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05)

Recommendations

• Groebner bases for linear codes over GF(4)
• scientific article; zbMATH DE number 5863220
• Linear codes as binomial ideals
• A decoding algorithm for binary linear codes using Groebner bases
• Gröbner bases and combinatorics for binary codes

Cited in

(4)

• Heuristic decoding of linear codes using commutative algebra
• Groebner bases for linear codes over GF(4)
• Standard bases for binary linear codes
• Linear label code of a root lattice using Gröbner bases

This page was built for publication: Groebner bases for quaternary codes

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