2000 character limit reached
Affine cartesian codes
Published 1 Feb 2012 in math.AC, cs.IT, math.AG, math.CO, and math.IT | (1202.0085v3)
Abstract: We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with prescribed parameters. As an application of our results, we recover the formulas for the minimum distance of various families of evaluation codes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.