Toric complete intersection codes
arXiv:1111.0356 · doi:10.1016/j.jsc.2012.08.006
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.
14 pages, 2 figures. Minor changes, simpler proofs, new examples
Cited by in corpus (7)
- Coding theory package for Macaulay2
- Multigraded Hilbert function and toric complete intersection codes
- Toric Codes and Lattice Ideals
- On dual toric complete intersection codes
- Differential Codes on Higher Dimensional Varieties Via Grothendieck's Residue Symbol
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- On parameterised toric codes