Toric surfaces and error-correcting codes

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)

Review text

Let \(M\) be a free \({\mathbb Z}\)-module of rank 2, and let \(P\) be an integral convex polytope in \(M\otimes {\mathbb R}\). Let \(\xi\) be a primitive element in the finite field \({\mathbb F}_q\). The toric code associated to the polytope \(P\) is the linear code of length \((q-1)^2\) generated by the \(n\)-tuples with coordinates \(\xi^{i\lambda_1}\xi^{j\lambda_2}\), where \(0\leq i,j\leq q-1\), and where each \(n\)-tuple corresponds to a lattice point \((\lambda_1,\lambda_2)\) of \(P\). These codes may be viewed as coming from evaluating certain rational functions at rational points on a toric surface. The author uses results about the cohomology and intersection theory of toric varieties to obtain the dimension and a bound on the minimum distance of these codes for three classes of polytopes: a triangle with vertices \((0,0), (a,a), (0,2a)\); a triangle with vertices \((0,0), (a,0), (0,a)\); and a rectangle with vertices \((0,0), (a,0), (a,b), (0,b)\). For the entire collection see [Zbl 0930.00089].

Recommendations

Cited in

(43)

This page was built for publication: Toric surfaces and error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485867)