Algebraic geometry codes from polyhedral divisors (Q975820)

Consider a complete normal variety \(X\) having a codimension one torus action of \(T\subset X\). The authors describe \(T\)-invariant Weil and Cartier divisors and provide formulas for computing global sections, intersection numbers and Euler characteristics. As an application, the authors use divisors on \(X\) to define new evaluation codes called \(T\)-codes. We find estimates on their minimum distance using intersection theory. Numerous examples conclude the paper, indicating that the class of \(T\)-codes forms some of the best known codes in many cases.