From a rational convex polytope of dimension r ≥ 2 J.P. Hansen con-structed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope is the same datum as a normal toric variety and a Cartier divisor. The code is obtained evaluating rational functions of the toric variety defined by the polytope at the algebraic torus, and it is an evaluation code in the sense of Goppa. We compute the dimension of the code using cohomology. The minimum distance is estimated using intersection theory and mixed volumes, extending the methods of J.P. Hansen for plane polytopes. Finally we give counterexamples to Joyner’s conjectures [10].
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
Abstract. In this paper we discuss combinatorial questions about lattice polytopes motivated by rece...
We describe two different approaches to making systematic classifications of plane lattice polygons,...
AbstractFrom a rational convex polytope of dimension r⩾2 J.P. Hansen constructed an error correcting...
. For any integral convex polytope in R 2 there is an explicit construction of an error-correcting...
International audienceAny integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional ...
For any integral convex polytope in R 2 there is an explicit construction of an error-correcting c...
In 1998, J. P. Hansen introduced the construction of an error-correcting code over a finite field Fq...
AbstractToric codes are obtained by evaluating rational functions of a nonsingular toric variety at ...
Toric codes are obtained by evaluating rational functions of a nonsin-gular toric variety at the alg...
We call a polytope terraced if upon projecting onto a one-dimensional coordinate space, each fiber o...
AbstractA description of complete normal varieties with lower-dimensional torus action has been give...
We define a statistical measure of the typical size of words of low weight in a linear code over a f...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
This paper is concerned with the minimum distance computation for higher dimensional toric codes def...
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
Abstract. In this paper we discuss combinatorial questions about lattice polytopes motivated by rece...
We describe two different approaches to making systematic classifications of plane lattice polygons,...
AbstractFrom a rational convex polytope of dimension r⩾2 J.P. Hansen constructed an error correcting...
. For any integral convex polytope in R 2 there is an explicit construction of an error-correcting...
International audienceAny integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional ...
For any integral convex polytope in R 2 there is an explicit construction of an error-correcting c...
In 1998, J. P. Hansen introduced the construction of an error-correcting code over a finite field Fq...
AbstractToric codes are obtained by evaluating rational functions of a nonsingular toric variety at ...
Toric codes are obtained by evaluating rational functions of a nonsin-gular toric variety at the alg...
We call a polytope terraced if upon projecting onto a one-dimensional coordinate space, each fiber o...
AbstractA description of complete normal varieties with lower-dimensional torus action has been give...
We define a statistical measure of the typical size of words of low weight in a linear code over a f...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
This paper is concerned with the minimum distance computation for higher dimensional toric codes def...
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
Abstract. In this paper we discuss combinatorial questions about lattice polytopes motivated by rece...
We describe two different approaches to making systematic classifications of plane lattice polygons,...