Footprints or generalized Bezout's theorem

DOI10.1109/18.825832zbMath1001.94040OpenAlexW2128439756MaRDI QIDQ4503533

Olav Geil, Tom Høholdt

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.825832

zbMATH Keywords

Gröbner basislinear codesgeneralized Hamming weightsevaluation codesBézout's theorem

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (26)

The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ On parameters of subfield subcodes of extended norm-trace codes ⋮ Relative generalized Hamming weights of affine Cartesian codes ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ On codes from norm-trace curves ⋮ Relative generalized Hamming weights of evaluation codes ⋮ On the subfield subcodes of Hermitian codes ⋮ Evaluation codes and their basic parameters ⋮ On affine variety codes from the Klein quartic ⋮ Vanishing ideals of projective spaces over finite fields and a projective footprint bound ⋮ On multivariate polynomials with many roots over a finite grid ⋮ More results on the number of zeros of multiplicity at least \(r\) ⋮ Generalized minimum distance functions ⋮ Footprint and minimum distance functions ⋮ Decreasing norm-trace codes ⋮ On the generalized Hamming weights of hyperbolic codes ⋮ The dual of an evaluation code ⋮ Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes ⋮ Hermitian codes and complete intersections ⋮ Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives ⋮ Algebraic geometric codes on minimal Hirzebruch surfaces ⋮ THE NUMBER OF ROOTS OF A POLYNOMIAL SYSTEM ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019 ⋮ An improvement of the Feng-Rao bound for primary codes ⋮ Projective toric codes

This page was built for publication: Footprints or generalized Bezout's theorem