English
Related papers

Related papers: Hulls of Projective Reed-Muller Codes

200 papers

The hull of a linear code (i.e., a finite field vector space)~\({\mathcal C}\) is defined to be the vector space formed by the intersection of~\({\mathcal C}\) with its dual~\({\mathcal C}^{\perp}.\) Constructing vector spaces with a…

Information Theory · Computer Science 2023-05-15 Ghurumuruhan Ganesan

We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…

Information Theory · Computer Science 2025-09-30 Elena Berardini , Xavier Caruso

Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…

Combinatorics · Mathematics 2019-12-02 Dean Crnkovic , Ronan Egan , B. G. Rodrigues , Andrea Svob

In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…

Information Theory · Computer Science 2024-02-06 Eduardo Camps , Hiram H. López , Gretchen L. Matthews

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…

Algebraic Geometry · Mathematics 2024-02-07 Cicero Carvalho , V. G. Lopez Neumann , Hiram H. Lopez

We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas…

Information Theory · Computer Science 2025-07-25 Oisin Campion , Rodrigo San-José

We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…

Information Theory · Computer Science 2026-04-21 Alain Couvreur , Rati Ludhani

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

Information Theory · Computer Science 2026-05-13 Sujata Bansal , Pramod Kumar Kewat

For odd length $n$, the cyclic codes construction over $\Re= \Z_4[v]/ \langle v^2-v \rangle$ is provided. The hulls of cyclic codes over $\Re$ are studied. The average $2$-dimension $E(n)$ of the hulls of cyclic codes over $\Re$ is also…

Information Theory · Computer Science 2019-04-09 Narendra Kumar , Abhay Kumar Singh

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

Information Theory · Computer Science 2013-04-09 Stéphane Ballet , Robert Rolland

Labourie and the author independently showed that a convex real projective structure on an oriented surface of genus at least 2 is equivalent to a conformal structure plus a holomorphic cubic differential U. We analyze the behavior of the…

Differential Geometry · Mathematics 2007-05-23 John C. Loftin

We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We…

Information Theory · Computer Science 2024-01-09 Zohreh Aliabadi , Cem Güneri , Tekgül Kalaycı

Lifted Reed-Solomon codes, introduced by Guo, Kopparty and Sudan in 2013, are known as one of the few families of high-rate locally correctable codes. They are built through the evaluation over the affine space of multivariate polynomials…

Information Theory · Computer Science 2018-09-05 Julien Lavauzelle

In this paper, we find a necessary and sufficient condition for multi-twisted Reed-Solomon codes to be MDS. In particular, we introduce a new class of MDS double-twisted Reed-Solomon codes $\mathcal{C}_{\bm \alpha, \bm t, \bm h, \bm \eta}$…

Information Theory · Computer Science 2023-12-15 Harshdeep Singh , Kapish Chand Meena

Let $\mathrm{SLAut}(\mathbb{F}_{q}^{n})$ denote the group of all semilinear isometries on $\mathbb{F}_{q}^{n}$, where $q=p^{e}$ is a prime power. In this paper, we investigate general properties of linear codes associated with $\sigma$…

Information Theory · Computer Science 2023-03-27 Meng Cao , Jing Yang

The Euclidean hull of a linear code $C$ is the intersection of $C$ with its Euclidean dual $C^\perp$. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the…

Information Theory · Computer Science 2021-01-19 Lin Sok

The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…

Information Theory · Computer Science 2025-01-14 Swastik Kopparty , Mrinal Kumar , Harry Sha

In this paper, we obtain new results on the covering radius and deep holes for projective Reed-Solomon (PRS) codes.

Information Theory · Computer Science 2016-05-10 Jun Zhang , Daqing Wan

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the direct sum construction and the $(\mathbf{u},\mathbf{u+v})$-construction. Some new criteria for the…

Information Theory · Computer Science 2022-12-20 Yang Li , Shixin Zhu , Edgar Martínez-Moro