English
Related papers

Related papers: On Construction of Linear (Euclidean) Hull Codes o…

200 papers

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

Information Theory · Computer Science 2024-04-09 Gaojun Luo , Lin Sok , Martianus Frederic Ezerman , San Ling

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…

Information Theory · Computer Science 2017-03-17 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…

Information Theory · Computer Science 2023-02-14 Shitao Li , Minjia Shi , Huizhou Liu

Projective Reed-Muller codes are constructed from the family of projective hypersurfaces of a fixed degree over a finite field $\F_q$. We consider the relationship between projective Reed-Muller codes and their duals. We determine when…

Information Theory · Computer Science 2024-06-10 Nathan Kaplan , Jon-Lark Kim

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Information Theory · Computer Science 2020-11-23 Hugues Randriambololona

By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed-Muller codes over the projective plane. The dimension of the hull determines the minimum number of…

Information Theory · Computer Science 2025-03-03 Diego Ruano , Rodrigo San-José

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…

Information Theory · Computer Science 2024-01-03 Astha Agrawal , R. K. Sharma

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

Information Theory · Computer Science 2022-07-19 Lin Sok

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

There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal…

Information Theory · Computer Science 2025-11-10 Junmin An , Nathan Kaplan , Jon-Lark Kim , Jinquan Luo , Guodong Wang

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…

Information Theory · Computer Science 2018-07-13 Gaojun Luo , Xiwang Cao

From a given $[n, k]$ code $C$, we give a method for constructing many $[n, k]$ codes $C'$ such that the hull dimensions of $C$ and $C'$ are identical. This method can be applied to constructions of both self-dual codes and linear…

Information Theory · Computer Science 2021-08-31 Keita Ishizuka , Ken Saito

Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…

Information Theory · Computer Science 2022-11-29 Shitao Li , Minjia Shi , Huizhou Liu

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

Given two $q$-ary codes $C_1$ and $C_2$, the relative hull of $C_1$ with respect to $C_2$ is the intersection $C_1\cap C_2^\perp$. We prove that when $q>2$, the relative hull dimension can be repeatedly reduced by one, down to a certain…

Information Theory · Computer Science 2023-12-27 Sarah E. Anderson , Eduardo Camps-Moreno , Hiram H. López , Gretchen L. Matthews , Diego Ruano , Ivan Soprunov

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

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é

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

Information Theory · Computer Science 2015-06-08 Steven T. Dougherty , Jon-Lark Kim , Buket Ozkaya , Lin Sok , Patrick Solé