Reed-Muller codes on complete intersections.

DOI10.1007/s002000000047zbMath1076.94043OpenAlexW2074781042MaRDI QIDQ5941640

Horacio Tapia-Recillas, Iwan M. Duursma, Carlos Rentería Márquez

Publication date: 20 August 2001

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000000047

zbMATH Keywords

Complete intersection, Reed-Muller code, Hilbert polynomial, Vanishing ideal, a-invariant of an ideal, Graded finite free resolution, Canonical module.

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)

Related Items (41)

Direct products in projective Segre codes ⋮ Multigraded Hilbert functions and toric complete intersection codes ⋮ Toric codes and lattice ideals ⋮ The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES ⋮ Minimum distance functions of graded ideals and Reed-Muller-type codes ⋮ Projective nested Cartesian codes ⋮ Complete intersection vanishing ideals on degenerate tori over finite fields ⋮ Minimum distance of some evaluation codes ⋮ Vanishing ideals over complete multipartite graphs ⋮ Parameterized codes associated to the edges of some subgraphs of a simple graph ⋮ Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields ⋮ Projective Reed-Muller type codes on rational normal scrolls ⋮ Generalized Hamming weights and some parameterized codes ⋮ Complete intersection vanishing ideals on sets of clutter type over finite fields ⋮ Relative generalized Hamming weights of evaluation codes ⋮ Parameterized codes over graphs ⋮ Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes ⋮ Lattice Ideals, Semigroups and Toric Codes ⋮ The minimum distance of parameterized codes on projective tori ⋮ The Horace method for error-correcting codes ⋮ Affine Cartesian codes ⋮ Computing the degree of a lattice ideal of dimension one ⋮ Evaluation codes and their basic parameters ⋮ Regularity and algebraic properties of certain lattice ideals ⋮ Minimum distance functions of complete intersections ⋮ Skeleton simplicial evaluation codes ⋮ Cayley-Bacharach and evaluation codes on complete intersections ⋮ Uniformity for geometric codes over large extensions of \(\mathbb F_q\) ⋮ Generalized minimum distance functions ⋮ Codes over a weighted torus ⋮ On dual toric complete intersection codes ⋮ Generalized Hamming weights of projective Reed-Muller-type codes over graphs ⋮ Generalized minimum distance functions and algebraic invariants of Geramita ideals ⋮ The dual of an evaluation code ⋮ Projective Reed-Muller type codes on higher dimensional scrolls ⋮ The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields ⋮ Vanishing Ideals Over Graphs and Even Cycles ⋮ COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS ⋮ Codes from flag varieties over a finite field ⋮ Reed-Muller-type codes over the Segre variety

This page was built for publication: Reed-Muller codes on complete intersections.