Toric complete intersection codes

DOI10.1016/J.JSC.2012.08.006MaRDI QIDQ1930179zbMATH OpenOpenAlexFDO

Authors Ivan Soprunov

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.0356

zbMATH Keywords

evaluation codesglobal residueNewton polytopetoric variety

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

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.

Review text

This article combines two topics: toric codes (algebraic geometry codes over toric varieties) and evaluation codes over complete intersections. In order to construct a toric code, rational functions of a Riemann-Roch space are evaluated at points of a toric variety, usually the algebraic torus. However, the article under review considers a complete intersection on a toric variety, instead of the algebraic torus, and such family of codes is called toric complete intersection codes. The minimum distance of these codes is estimated in the article. The results extend previous results for evaluation codes over complete intersections. However, the article does not use the Cayley-Barach theorem. The article obtains two bounds under different assumptions. Conditions for defining codes verifying such conditions are given. Moreover, several interesting codes are constructed. The paper is well written. The preliminaries and the examples facilitate its reading.

Recommendations

• Toric Surface Codes and Minkowski Sums
• Cayley-Bacharach and evaluation codes on complete intersections
• Toric residue codes. I.
• Minimum distance of some evaluation codes
• Algebraic geometry codes from polyhedral divisors

Cited in

(22)

• On the structure of generalized toric codes
• Linkage and codes on complete intersections
• Toric codes and lattice ideals
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Cayley-Bacharach and evaluation codes on complete intersections
• Toric codes over finite fields
• Codes over a weighted torus
• On dual toric complete intersection codes
• Coding theory package for Macaulay2
• Multigraded Hilbert functions and toric complete intersection codes
• Evaluation codes over a particular complete intersection
• Evaluation codes along subsets of complete intersections
• Complete intersections in projective space and small weight codewords of duals of algebro-geometric codes
• Minimum distance of some evaluation codes
• Projective toric codes
• Lattice ideals, semigroups and toric codes
• Rational points of lattice ideals on a toric variety and toric codes
• On parameterized toric codes
• Differential codes on higher dimensional varieties via Grothendieck's residue symbol
• Toric residue codes. I.
• Lower bounds on minimal distance of evaluation codes
• Algebraic geometry codes from polyhedral divisors

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)