Gröbner bases and combinatorics for binary codes
From MaRDI portal
Publication:985374
Abstract: In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for the code. By associating the code with the set of cycles in a graph, we can solve the problem of finding all codewords of minimal length (minimal cycles in a graph), and show how to find a minimal cycle basis. Finally we discuss some results on the computation of the Gr"obner basis.
Recommendations
Cites work
- scientific article; zbMATH DE number 1262441 (Why is no real title available?)
- scientific article; zbMATH DE number 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- A Gröbner basis technique for Padé approximation
- A Gröbner representation for linear codes
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Bounds for the degrees in the Nullstellensatz
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Error-Correction Capability of Binary Linear Codes
- On a Gröbner bases structure associated to linear codes
- Solving a multivariable congruence by change of term order
- Union of all the minimum cycle bases of a graph
Cited in
(24)- Computing Gröbner bases associated with lattices
- Gröbner bases methods in coding theory
- Gröbner representations of binary matroids
- An application of Möller's algorithm to coding theory
- Gröbner bases for perfect binary linear codes
- scientific article; zbMATH DE number 493097 (Why is no real title available?)
- scientific article; zbMATH DE number 1163423 (Why is no real title available?)
- Computing sharp recovery structures for locally recoverable codes
- Algebraic structure of the minimal support codewords set of some linear codes
- Binomial coefficient codes over GF(2)
- Characteristic vector and weight distribution of a linear code
- On the fan associated to a linear code
- Groebner bases for quaternary codes
- Gröbner bases of certain zero-dimensional ideals arising in coding theory
- Decomposition of modular codes for computing test sets and Graver basis
- On a Gröbner bases structure associated to linear codes
- Computing coset leaders and leader codewords of binary codes
- Linear label code of a root lattice using Gröbner bases
- On the ideal associated to a linear code
- Heuristic decoding of linear codes using commutative algebra
- Trial set and Gröbner bases for binary codes
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Gröbner bases over commutative rings and applications to coding theory
- Algebraic modelling of covering arrays
This page was built for publication: Gröbner bases and combinatorics for binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985374)
