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].











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)