Gröbner bases for perfect binary linear codes

DOI10.12732/IJPAM.V91I3.1MaRDI QIDQ5417186zbMATH OpenOpenAlexFDO

Authors Natalia Dück, Karl-Heinz Zimmermann

Publication date 16 May 2014

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

Full work available at URL http://ijpam.eu/contents/2014-91-2/2/index.html

zbMATH Keywords

Gröbner basislinear codeminimum distanceperfect codeSteiner system

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Steiner systems in finite geometry (51E10) Linear codes (general theory) (94B05)

Recommendations

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

Cited in

(11)

• Gröbner bases of certain zero-dimensional ideals arising in coding theory
• Heuristic decoding of linear codes using commutative algebra
• scientific article; zbMATH DE number 5885942 (Why is no real title available?)
• scientific article; zbMATH DE number 5863220 (Why is no real title available?)
• Linear codes as binomial ideals
• On the fan associated to a linear code
• Gröbner representations of binary matroids
• scientific article; zbMATH DE number 493097 (Why is no real title available?)
• Trial set and Gröbner bases for binary codes
• A decoding algorithm for binary linear codes using Groebner bases
• scientific article; zbMATH DE number 2222667 (Why is no real title available?)

Describes a project that uses

Uses Software

• SINGULAR

This page was built for publication: Gröbner bases for perfect binary linear codes

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