Toric complete intersection codes
From MaRDI portal
Abstract: In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation codes on complete intersections in the projective space.
Recommendations
Cited in
(22)- Coding theory package for Macaulay2
- Minimum distance of some evaluation codes
- Algebraic geometry codes from polyhedral divisors
- Evaluation codes along subsets of complete intersections
- Rational points of lattice ideals on a toric variety and toric codes
- On parameterized toric 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
- Evaluation codes over a particular complete intersection
- Lattice ideals, semigroups and toric codes
- Cayley-Bacharach and evaluation codes on complete intersections
- Differential codes on higher dimensional varieties via Grothendieck's residue symbol
- Codes over a weighted torus
- On the structure of generalized toric codes
- Toric residue codes. I.
- Complete intersections in projective space and small weight codewords of duals of algebro-geometric codes
- Lower bounds on minimal distance of evaluation codes
- Projective toric codes
- Toric codes over finite fields
- On dual toric complete intersection codes
- Linkage and codes on complete intersections
This page was built for publication: Toric complete intersection codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930179)