GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
From MaRDI portal
Publication:3595326
DOI10.1142/S0219498807002260zbMath1155.94020OpenAlexW2076007689MaRDI QIDQ3595326
Publication date: 10 August 2007
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498807002260
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15)
Related Items (7)
Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve ⋮ Computation of the weight distribution of CRC codes ⋮ On the small-weight codewords of some Hermitian codes ⋮ Weight distribution of Hermitian codes and matrices rank ⋮ Characteristic vector and weight distribution of a linear code ⋮ A commutative algebra approach to linear codes ⋮ HELP: a sparse error locator polynomial for BCH codes
Cites Work
- Correcting errors and erasures via the syndrome variety
- 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)
- 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>
- A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
- On computing the weight spectrum of cyclic codes
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- The weight distributions of extended binary primitive BCH codes of length 128
- On the distance distribution of duals of BCH codes
- More on the distance distribution of BCH codes
- A class of constacyclic codes
- The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
- A class of shortened cyclic codes for a compound channel (Corresp.)
- A shortened cyclic code for multiple errors (Corresp.)
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- Bounds for exponential sums
This page was built for publication: GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES