2000 character limit reached
On dual toric complete intersection codes (1310.5061v1)
Published 18 Oct 2013 in math.AG, cs.IT, and math.IT
Abstract: In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be quasi-self-dual. In the case of d=2 it reduces to a combinatorial condition on the Newton polygons. This allows us to give an explicit construction of dual and quasi-self-dual toric complete intersection codes. We provide a list of examples over the field of 16 elements.