Toric complete intersection codes (Q1930179)

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.