Hulls of projective Reed-Muller codes
Let \(\mathcal{P}=\{P_{1},...,P_{N}\}\) be a subset of points in the projective space \(\mathbb{P}^{n}(\mathbb{F}_{q}).\) The projective Reed-Muller code of order \(k\), denoted as \(RM_{q}^{P}(k,n)\) or \(C_{n,k}^{q}\), is defined as the image of the evaluation map when \(\mathcal{P}\) consists of all points in \(\mathbb{P}^{n}(\mathbb{F}_{q})\) and \(V\) is the set of all homogeneous polynomials of degree \(k\). The hull of a code is defined as \(\operatorname{Hull}(C) = C \cap C^{\perp}.\) A linear code \(C\) is self-orthogonal if \(C \subseteq C^{\perp},\) \(C\) is self-dual if \(C=C^{\perp}.\) A linear complementary dual code (LCD) is a code with a trivial hull.\N\NThis work studies projective Reed-Muller codes, which are the projective analogue of Reed-Solomon codes. Building on \textit{A. B. Sørensen}'s analysis of the dual of a projective Reed-Muller code [IEEE Trans. Inf. Theory 37, No. 6, 1567--1576 (1991; Zbl 0741.94016)] the authors completely determine when projective Reed-Muller codes are self-dual, when they are self-orthogonal, and when they are LCD.\N\NThe duals of \(C_{n,k}^{q}\) are determined in the two cases: when \(k \equiv 0 \pmod{q-1}\) and \(k \not\equiv 0 \pmod{q-1}.\) For a sufficiently large \(q,\) the dimension of the hull of a projective Reed-Muller code is proved to be one less than the dimension of the code. The dimension of the hull for a wider range of parameters is also determined. Lastly, parameters for which the results in this paper do not determine the dimension of the hull are shown, thus providing an outlook for future work. The paper provides ample examples to illustrate the results.
- A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
- Automorphism groups of homogeneous and projective Reed-Muller codes
- Constructions of good entanglement-assisted quantum error correcting codes
- Correcting quantum errors with entanglement
- Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
- Fundamentals of Error-Correcting Codes
- Homogeneous polynomials vanishing on the projective space \(\mathbb{P}^m(\mathbb{F}_q)\)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1209696 (Why is no real title available?)
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes
- Hulls of projective Reed-Muller codes over the projective plane
- Hulls of Reed-Solomon Codes via Algebraic Geometry Codes
- Linear \(\ell \)-intersection pairs of codes and their applications
- Linear codes with complementary duals
- Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields
- On generalized ReedMuller codes and their relatives
- On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes
- Polynomial codes
- Projective Reed-Muller codes
- Projective reed-muller codes
- Quantum error-correcting codes from projective Reed-Muller codes and their hull variation problem
- Relative hulls and quantum codes
- Reversible codes
- Self-dual codes over GF(5)
- Some bounds on binary LCD codes
- The combinatorics of LCD codes: linear programming bound and orthogonal matrices
- The parameters of projective Reed-Müller codes
- Weight enumerators of Reed-Muller codes from cubic curves and their duals
This page was built for publication: Hulls of projective Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009887)
