A commutative algebra approach to linear codes

DOI10.1016/j.jalgebra.2008.09.037zbMath1171.94013OpenAlexW2053960800MaRDI QIDQ1024390

Massimiliano Sala, Marta Giorgetti

Publication date: 17 June 2009

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2008.09.037

zbMATH Keywords

Gröbner basislinear codeweight distributioncyclic codeGoppa codealgebraic geometric code\(n\)-th root codeerror locator polynomialReed-Muller-codezerofree code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15)

Related Items (4)

Improved decoding of affine-variety codes ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Characteristic vector and weight distribution of a linear code ⋮ A commutative algebra approach to linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correcting errors and erasures via the syndrome variety
• Algebraic function fields and codes
• A commutative algebra approach to linear codes
• Decoding affine variety codes using Gröbner bases
• On the Gröbner bases of some symmetric systems and their application to coding theory.
• Gröbner bases and distance of cyclic codes
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• A linear programming estimate of the weight distribution of BCH (255,k)
• On a class of error correcting binary group codes
• Which linear codes are algebraic-geometric?
• The hardness of decoding linear codes with preprocessing
• A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
• A new lower bound for the minimum distance of a cyclic code
• On computing the weight spectrum of cyclic codes
• Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
• Constructions in Algebra
• On the complexity of minimum distance decoding of long linear codes
• On the key equation
• Solving systems of algebraic equations by using gröbner bases
• Properties of Gröbner bases under specializations

This page was built for publication: A commutative algebra approach to linear codes