相关论文: The Hulls of Matrix-Product Codes over Commutative…
A well-known lower bound (over finite fields and some special finite commutative rings) on the Hamming distance of a matrix-product code (MPC) is shown to remain valid over any commutative ring $R$. A sufficient condition is given, as well,…
Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…
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. Matrix-product (MP) codes are a class of long classical codes generated by combining several…
Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…
Linear complementary dual codes (LCD) are linear codes satisfying $C\cap C^{\perp}=\{0\}$. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal…
The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…
The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product…
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…
The $\ell$-Galois hull $h_{\ell}(C)$ of an $[n,k]$ linear code $C$ over a finite field $\mathbb{F}_q$ is the intersection of $C$ and $C^{{\bot}_{\ell}}$, where $C^{\bot_{\ell}}$ denotes the $\ell$-Galois dual of $C$ which introduced by Fan…
The Euclidean hull of a linear code $C$ is defined as $C\cap C^{\perp}$, where $C^\perp$ denotes the dual of $C$ under the Euclidean inner product. A linear code with zero hull dimension is called a linear complementary dual (LCD) code. A…
We define the Euclidean hull of a linear code $C$ as the intersection of $C$ and 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 matrix-product (MP) code $\mathcal{C}_{A,k}:=[\mathcal{C}_{1},\mathcal{C}_{2},\ldots,\mathcal{C}_{k}]\cdot A$ with a non-singular by column (NSC) matrix $A$ plays an important role in constructing good quantum error-correcting codes. In…
The intersection of a linear code with its dual is called the hull of the code. It is known that, for classical linear codes under the Hamming-metric, the dimension of the hull can be reduced up to equivalence. This phenomenon leads to the…
This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle \kappa,\tau \mid 2 \kappa =2 \tau=0,~ \kappa^2=\kappa,~ \tau^2=\tau,~ \kappa \tau=\kappa,~ \tau \kappa=\tau \rangle$. Initially, we examine the…
A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…
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…
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…
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…