A decoding algorithm for binary linear codes using Groebner bases

MaRDI QIDQ5383374zbMATH OpenFDO

Authors Jean Jacques Ferdinand Randriamiarampanahy, Harinaivo Andriatahiny, Toussaint Joseph Rabeherimanana

Publication date 21 June 2019

Full work available at URL https://arxiv.org/abs/1810.04536, http://ijmcs.future-in-tech.net/14.2/R-Randr.pdf

zbMATH Keywords

decodingGroebner basislinear 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) Decoding (94B35)

Abstract: It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear codes by utilizing the Groebner bases of the associated ideals.

Recommendations

• scientific article; zbMATH DE number 5863220
• scientific article; zbMATH DE number 1276822
• scientific article; zbMATH DE number 2222667
• Gröbner bases for perfect binary linear codes
• Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
• On the decoding of cyclic codes using Gröbner bases
• A Gröbner representation for linear codes
• Decoding affine variety codes using Gröbner bases
• Bounded distance decoding of linear error-correcting codes with Gröbner bases
• scientific article; zbMATH DE number 3963726

Cited in

(20)

• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• Decomposition of modular codes for computing test sets and Graver basis
• Algebraic structure of the minimal support codewords set of some linear codes
• Heuristic decoding of linear codes using commutative algebra
• A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes
• An application of the FGLM techniques to linear codes
• Groebner bases for quaternary codes
• Coset decomposition method for decoding linear codes
• A semigroup approach to complete decoding
• On the ideal associated to a linear code
• On a Gröbner bases structure associated to linear codes
• An application of Möller's algorithm to coding theory
• Standard bases for binary linear codes
• Error-correction of linear codes via colon ideals
• Computing coset leaders and leader codewords of binary codes
• Gröbner bases for perfect binary linear codes
• A Gröbner representation for linear codes
• scientific article; zbMATH DE number 2222667 (Why is no real title available?)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases
• Gröbner bases and combinatorics for binary codes

This page was built for publication: A decoding algorithm for binary linear codes using Groebner bases

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