Direct products in projective Segre codes

From MaRDI portal



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.


The authors consider a new family of codes, projective Segre codes, the Segre embedding of two projective Reed-Muller codes. The authors show that a Segre code is equal to the Segre product of the two Reed-Muller codes that defined the Segre code (direct products of projective Reed-Muller type codes).NEWLINENEWLINEThe parameters of a Segre code (length, dimension, minimum distance) are given in terms of the two projective Reed-Muller codes used to define the Segre code. The mathematical tools are Hilbert functions, resolutions and Gröbner bases.



Cites work









This page was built for publication: Direct products in projective Segre codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268479)