Linear codes as binomial ideals

MaRDI QIDQ3162358zbMATH OpenFDO

Authors Mehwish Saleemi, Karl-Heinz Zimmermann

Publication date 19 October 2010

zbMATH Keywords

binomial idealGraver baseGroebner baselinear code

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

• scientific article; zbMATH DE number 5863220
• Groebner bases for linear codes over GF(4)
• scientific article; zbMATH DE number 5885942
• On the ideal associated to a linear code
• Gröbner bases for perfect binary linear codes

Cited in

(13)

• Bilinear forms and linear codes
• Binomial difference ideals
• The ideal entropy of BCI-algebras and its application in the binary linear codes
• Heuristic decoding of linear codes using commutative algebra
• Groebner bases for quaternary codes
• Groebner bases for linear codes over GF(4)
• scientific article; zbMATH DE number 5885942 (Why is no real title available?)
• On the ideal associated to a linear code
• On the fan associated to a linear code
• Standard bases for binary linear codes
• Error-correction of linear codes via colon ideals
• Gröbner bases for perfect binary linear codes
• Linear label code of a root lattice using Gröbner bases

This page was built for publication: Linear codes as binomial ideals

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