A commutative algebra approach to linear codes
type: Item
instance of: scholarly article
title: A commutative algebra approach to linear codes
zbMATH Open document ID: 1171.94013
author: Marta Giorgetti
author: Massimiliano Sala
published in: Journal of Algebra
publication date: 2009-06-17T00:00:00Z
review text: The authors generalize the notion of a cyclic code which allows the extension of computational algebra techniques to larger classes of codes. A linear code over the field GF\((q)\) is called an \(n\)-th \textit{root code} if it has, as parity-check matrix, a matrix \(H=(g_i(\ell_j))_{{i=1,\dots,r\atop j=1,\dots,N}}\) where \(\ell_1,\dots,\ell_N\) are different and \(n\)-th roots of unity (or zero) and lie in an extension field \(F=\)GF\((q^m)\) and where \(g_1,\dots,g_r\) are polynomials over \(F\) such that for all \(j\in\{ 1,\dots,N\}\) there is at least one \(i\in\{ 1,\dots,r\}\) with \(g_i(\ell_j)\neq 0\). It is shown that any linear code is an \(n\)-th root code (and vice versa). Given a representation of a code \(\mathcal{C}\) as \(n\)-th root code, distance and weight distribution of \(\mathcal{C}\) can be computed via Gröbner basis techniques. The decoding techniques of \textit{E. Orsini} and \textit{M. Sala} [J. Pure Appl. Algebra 200, No. 1--2, 191--226 (2005; Zbl 1159.94397)] via the general error locator polynomial can be extended to a large class of \(n\)-root codes (containing the ``proper maximal zerofree'' codes having \(\ell_i\neq 0\) for \(i=1,\dots,N\)) . An explicit example is given to show that, depending on the representation as \(n\)-th root code, its error locator polynomial can be small or long.
reviewed by: Ralph-Hardo Schulz
Mathematics Subject Classification ID: 94B15
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 5565631
zbMATH Keywords: linear code
zbMATH Keywords: weight distribution
zbMATH Keywords: Gröbner basis
zbMATH Keywords: error locator polynomial
zbMATH Keywords: \(n\)-th root code
zbMATH Keywords: zerofree code
zbMATH Keywords: cyclic code
zbMATH Keywords: Goppa code
zbMATH Keywords: Reed-Muller-code
zbMATH Keywords: algebraic geometric code
MaRDI profile type: Publication
full work available at URL: j.jalgebra.2008.09.037
OpenAlex ID: W2053960800
cites work: Q4242014
cites work: Q4279508
cites work: On computing the weight spectrum of cyclic codes
cites work: On the complexity of minimum distance decoding of long linear codes
cites work: The hardness of decoding linear codes with preprocessing
cites work: On a class of error correcting binary group codes
cites work: A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
cites work: The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
cites work: On the key equation
cites work: Decoding affine variety codes using Gröbner bases
cites work: Properties of Gröbner bases under specializations
cites work: Q3033872
cites work: Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
cites work: Solving systems of algebraic equations by using gröbner bases
cites work: Q4146667
cites work: On the Gröbner bases of some symmetric systems and their application to coding theory.
cites work: Correcting errors and erasures via the syndrome variety
cites work: 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>
cites work: Which linear codes are algebraic-geometric?
cites work: Q5665102
cites work: A new lower bound for the minimum distance of a cyclic code
cites work: Gröbner bases and distance of cyclic codes
cites work: GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
cites work: Constructions in Algebra
cites work: A linear programming estimate of the weight distribution of BCH\((255,k)\)
cites work: Algebraic function fields and codes
DOI: 10.1016/J.JALGEBRA.2008.09.037
Recommended article: Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
Recommended article: Decoding Cyclic Codes: the Cooper Philosophy
Recommended article: The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
Recommended article: Q4314353
Recommended article: General principles for the algebraic decoding of cyclic codes
Recommended article: Q5149074
Recommended article: Q4238967
Recommended article: HELP: a sparse error locator polynomial for BCH codes
Recommended article: Q3062122
Recommended article: Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases
description: scientific article; zbMATH DE number 5565631