  We study subfield-subcodes of Generalized Toric (GT) codes over
$\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes,
which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We
identify polynomial generators for subfield-subcodes of GT codes which allows
us to determine the dimensions and obtain bounds for the minimum distance. We
give several examples of binary and ternary subfield-subcodes of GT codes that
are the best known codes of a given dimension and length.
