A commutative algebra approach to linear codes
From MaRDI portal
Publication:1024390
DOI10.1016/j.jalgebra.2008.09.037zbMath1171.94013MaRDI 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
Gröbner basis; linear code; weight distribution; cyclic code; Goppa code; algebraic geometric code; \(n\)-th root code; error locator polynomial; Reed-Muller-code; zerofree code
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
94B15: Cyclic codes
Related Items
Improved decoding of affine-variety codes, Bounded distance decoding of linear error-correcting codes with Gröbner bases, 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 < 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
