Subfield subcodes of projective Reed-Muller codes
Philippe Gimenez, Diego Ruano, Rodrigo San-Jos\'e

TL;DR
This paper develops explicit bases and formulas for the dimensions of subfield subcodes of projective Reed-Muller codes, enabling the construction of long, efficient codes over small finite fields.
Contribution
It provides explicit bases, dimension formulas, and a universal Gr"obner basis for subfield subcodes of projective Reed-Muller codes, extending to general projective spaces.
Findings
Explicit bases for subfield subcodes and their duals.
Dimension formulas for these codes.
Construction of long codes with good parameters over small fields.
Abstract
Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective space, we generalize the necessary tools to deal with this case as well: we obtain a universal Gr\"obner basis for the vanishing ideal of the set of standard representatives of the projective space and we show how to reduce any monomial with respect to this Gr\"obner basis. With respect to the parameters of these codes, by considering subfield subcodes of projective Reed-Muller codes we obtain long linear codes with good parameters over a small finite field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication
