A commutative algebra approach to linear codes
From MaRDI portal
Publication:1024390
Recommendations
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- Decoding cyclic codes: the Cooper philosophy
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- scientific article; zbMATH DE number 691462
- General principles for the algebraic decoding of cyclic codes
- Zech tableaux as tools for sparse decoding
- scientific article; zbMATH DE number 1276822
- HELP: a sparse error locator polynomial for BCH codes
- Decoding and finding the minimum distance with Gröbner bases: history and new insights
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
Cites work
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 503187 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
- A commutative algebra approach to linear codes
- A linear programming estimate of the weight distribution of BCH\((255,k)\)
- A new lower bound for the minimum distance of a cyclic code
- Algebraic function fields and codes
- Constructions in Algebra
- Correcting errors and erasures via the syndrome variety
- Decoding affine variety codes using Gröbner bases
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Gröbner bases and distance of cyclic codes
- On a class of error correcting binary group codes
- On computing the weight spectrum of cyclic codes
- On the Gröbner bases of some symmetric systems and their application to coding theory.
- On the complexity of minimum distance decoding of long linear codes
- On the key equation
- Properties of Gröbner bases under specializations
- Solving systems of algebraic equations by using Gröbner bases
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- The hardness of decoding linear codes with preprocessing
- Which linear codes are algebraic-geometric?
Cited in
(10)- Gröbner bases for the distance distribution of systematic codes
- Communication code generation in systems of affine recurrence equations
- About the \(n\)th-root codes: a Gröbner basis approach to the weight computation
- Characteristic vector and weight distribution of a linear code
- On commutativity of duality operator and propagation operator of linear codes generated from algebraic curves
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- Improved decoding of affine-variety codes
- A commutative algebra approach to linear codes
- Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
This page was built for publication: A commutative algebra approach to linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024390)
