Abstract
For a given lattice polytope in , consider the space of trivariate polynomials over a finite field , whose Newton polytopes are contained in . We give an upper bound for the maximum number of -zeros of polynomials in in terms of the Minkowski length of and , the size of the field. Consequently, this produces lower bounds for the minimum distance of toric codes defined by evaluating elements of at the points of the algebraic torus . Our approach is based on understanding factorizations of polynomials in with the largest possible number of non-unit factors. The related combinatorial result that we obtain is a description of Minkowski sums of lattice polytopes contained in with the largest possible number of non-trivial summands.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.