Cyclic projective Reed-Muller codes
From MaRDI portal
The projective Reed-Muller codes (PRM codes) were introduced by \textit{G. Lachaud} [Lect. Notes Comput. Sci. 311, 125--129 (1988; Zbl 0651.94008)]. A change in the choice of the set of representatives of the projective space gives two PRM codes that are not equivalent by permutation. In this paper, we present some criteria in the choice of the set of representatives to construct cyclic or quasi-cyclic PRM codes. For the entire collection see [Zbl 0983.00064].
Recommendations
Cited in
(9)- Group structure on projective spaces and cyclic codes over finite fields
- Lifted projective Reed-Solomon codes
- Projective Reed-Muller codes
- Cyclic subcodes of generalized Reed-Muller codes
- scientific article; zbMATH DE number 2164123 (Why is no real title available?)
- Maximal weight divisors of projective Reed-Muller codes
- Two classes of constacyclic codes with variable parameters
- The support designs of several families of lifted linear codes
- The parameters of projective Reed-Müller codes
This page was built for publication: Cyclic projective Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474242)