Footprints or generalized Bezout's theorem

DOI10.1109/18.825832zbMath1001.94040MaRDI 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 basis; linear codes; generalized Hamming weights; evaluation codes; Bézout's theorem

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

Footprint and minimum distance functions, Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives, More results on the number of zeros of multiplicity at least \(r\), High dimensional affine codes whose square has a designed minimum distance, Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019, The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, On codes from norm-trace curves, On affine variety codes from the Klein quartic, Vanishing ideals of projective spaces over finite fields and a projective footprint bound, Generalized minimum distance functions, Relative generalized Hamming weights of affine Cartesian codes, Evaluation codes and their basic parameters, Hermitian codes and complete intersections, Algebraic geometric codes on minimal Hirzebruch surfaces, An improvement of the Feng-Rao bound for primary codes, On parameters of subfield subcodes of extended norm-trace codes, Minimum-weight codewords of the Hermitian codes are supported on complete intersections, On the subfield subcodes of Hermitian codes