# AG Codes from Polyhedral Divisors

@article{Ilten2008AGCF,
title={AG Codes from Polyhedral Divisors},
author={Nathan Owen Ilten and Hendrik S{\"u}{\ss}},
journal={ArXiv},
year={2008},
volume={abs/0811.2696}
}
• Published 17 November 2008
• Computer Science
• ArXiv

## References

SHOWING 1-10 OF 19 REFERENCES

### Gluing Affine Torus Actions Via Divisorial Fans

• Mathematics
• 2006
Generalizing the passage from a fan to a toric variety, we provide a combinatorial approach to construct arbitrary effective torus actions on normal, algebraic varieties. Based on the notion of a

### Error-Correcting Codes from Higher-Dimensional Varieties

Intersection theory is used to develop methods for obtaining lower bounds on the parameters of algebraic geometric error-correcting codes constructed from varieties of arbitrary dimension.

### Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes

• J. Hansen
• Mathematics
Applicable Algebra in Engineering, Communication and Computing
• 2002
This work treats Hirzebruch surfaces and an explicit construction of an error-correcting code of length (q-1)2 over the finite field 𝔽q, obtained by evaluation of rational functions on a toric surface associated to the polytope.

### Error Correcting Codes on Algebraic Surfaces

Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from

### Polyhedral Divisors and Algebraic Torus Actions

We provide a complete description of normal affine varieties with effective algebraic torus action in terms of what we call proper polyhedral divisors on semiprojective varieties. Our approach

### Toric Surface Codes and Minkowski Sums

• Computer Science
SIAM J. Discret. Math.
• 2006
Upper and lower bounds on the minimum distance of a toric code constructed from a polygon $P \subset {\mathbb R}^2$ are obtained by examining Minkowski sum decompositions of subpolygons of $P$.

### Toric Surface Codes and Minkowski Length of Polygons

• Mathematics, Computer Science
SIAM J. Discret. Math.
• 2009
New lower bounds for the minimum distance of a toric surface code $\mathcal{C}_P$ defined by a convex lattice polygon using the full Minkowski length of P is proved.

### A Weil theorem for singular curves

• Mathematics
• 1996
We generalize Weil's theorem on the number of rational points of smooth curves over a finite field to singular ones.

### Multiplier ideal sheaves and analytic methods in algebraic geometry

0. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1. Preliminary Material . . . . . . . . . . . . . . .