2000 character limit reached
Direct products in projective Segre codes
Published 8 Jan 2015 in math.AC, cs.IT, math.AG, and math.IT | (1501.01692v4)
Abstract: Let K=Fq be a finite field. We introduce a family of projective Reed-Muller-type codes called projective Segre codes. Using commutative algebra and linear algebra methods, we study their basic parameters and show that they are direct products of projective Reed-Muller-type codes. As a consequence we recover some results on projective Reed-Muller-type codes over the Segre variety and over projective tori.
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.
