Minimum distance functions of complete intersections
From MaRDI portal
Publication:4644375
DOI10.1142/S0219498818502043zbMath1404.13034arXiv1601.07604OpenAlexW2963271418WikidataQ121479261 ScholiaQ121479261MaRDI QIDQ4644375
Yuriko Pitones, José Martínez-Bernal, Rafael H. Villarreal
Publication date: 4 January 2019
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.07604
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items (10)
Coding theory package for Macaulay2 ⋮ The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ Regularity index of the generalized minimum distance function ⋮ Relative generalized Hamming weights of evaluation codes ⋮ Fat points, partial intersections and Hamming distance ⋮ Steiner systems and configurations of points ⋮ Evaluation codes and their basic parameters ⋮ Generalized minimum distance functions ⋮ Generalized minimum distance functions and algebraic invariants of Geramita ideals ⋮ High dimensional affine codes whose square has a designed minimum distance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- The minimum distance of parameterized codes on projective tori
- On the Alon-Füredi bound
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Lectures on results on Bezout's theorem. Notes by D. P. Patil
- On the second weight of generalized Reed-Muller codes
- Covering the cube by affine hyperplanes
- Equations over finite fields. An elementary approach
- Hilbert functions of graded algebras
- Introduction to liaison theory and deficiency modules
- Cayley-Bacharach and evaluation codes on complete intersections
- Reed-Muller-type codes over the Segre variety
- Weighted Reed-Muller codes revisited
- Bounding invariants of fat points using a coding theory construction
- Affine Cartesian codes
- On the second Hamming weight of some Reed-Muller type codes
- Parameterized affine codes
- Gröbner Bases, Coding, and Cryptography
- Projective Reed-Muller codes
- On Zeros of a Polynomial in a Finite Grid
- Regularity of lex-segment ideals: Some closed formulas and applications
- SINGULAR
- Monomial Algebras
- On generalized ReedMuller codes and their relatives
- Reed-Muller codes on complete intersections.
This page was built for publication: Minimum distance functions of complete intersections
