Add to ORKGIn this paper we construct evaluation codes on zero-dimensional complete intersections in toric varieties and give lower bounds for their minimum distance. This generalizes the results of Gold–Little–Schenck and Ballico–Fontanari who considered evaluation codes on complete intersections in the projective space
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results...
We obtain several classes of completely regular codes with different parameters, but identical inter...
A part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to th...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
AbstractA description of complete normal varieties with lower-dimensional torus action has been give...
In this paper we study duality for evaluation codes on intersections of ℓ hypersurfaces with given ℓ...
AbstractFrom a rational convex polytope of dimension r⩾2 J.P. Hansen constructed an error correcting...
AbstractHansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods to find a...
AbstractToric codes are obtained by evaluating rational functions of a nonsingular toric variety at ...
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen con-structed an error correcting code...
In 1998, J. P. Hansen introduced the construction of an error-correcting code over a finite field Fq...
Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ an...
We derive the transient distribution and periodic family of asymptotic distributions and the transie...
We call a polytope terraced if upon projecting onto a one-dimensional coordinate space, each fiber o...
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...
We obtain several classes of completely regular codes with different parameters, but identical inter...
A part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to th...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
AbstractA description of complete normal varieties with lower-dimensional torus action has been give...
In this paper we study duality for evaluation codes on intersections of ℓ hypersurfaces with given ℓ...
AbstractFrom a rational convex polytope of dimension r⩾2 J.P. Hansen constructed an error correcting...
AbstractHansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods to find a...
AbstractToric codes are obtained by evaluating rational functions of a nonsingular toric variety at ...
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen con-structed an error correcting code...
In 1998, J. P. Hansen introduced the construction of an error-correcting code over a finite field Fq...
Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ an...
We derive the transient distribution and periodic family of asymptotic distributions and the transie...
We call a polytope terraced if upon projecting onto a one-dimensional coordinate space, each fiber o...
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...
We obtain several classes of completely regular codes with different parameters, but identical inter...
A part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to th...