Related papers: An improved method for constructing linear codes w…
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$.…
The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…
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…
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…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
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…
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…
Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So…
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…
We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…
We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an…
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…
Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary dual (LCD) codes are useful in fault injections attacks on…
We propose a method for a classification of quaternary Hermitian LCD codes having large minimum weights. As an example, we give a classification of quaternary optimal Hermitian LCD codes of dimension 3.
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…
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently,…
We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…
The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…