A new method for constructing linear codes with small hulls
From MaRDI portal
Publication:2109389
Abstract: The hull of a linear code over finite fields is the intersection of the code and its dual, which was introduced by Assmus and Key. In this paper, we develop a method to construct linear codes with trivial hull ( LCD codes) and one-dimensional hull by employing the positive characteristic analogues of Gauss sums. These codes are quasi-abelian, and sometimes doubly circulant. Some sufficient conditions for a linear code to be an LCD code (resp. a linear code with one-dimensional hull) are presented. It is worth mentioning that we present a lower bound on the minimum distances of the constructed linear codes. As an application, using these conditions, we obtain some optimal or almost optimal LCD codes (resp. linear codes with one-dimensional hull) with respect to the online Database of Grassl.
Recommendations
Cites work
- Affine and projective planes
- Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
- Complementary Dual Algebraic Geometry Codes
- Complementary dual codes for counter-measures to side-channel attacks
- Computing automorphism groups of error-correcting codes
- Constructions of Linear Codes With One-Dimensional Hull
- Constructions of optimal LCD codes over large finite fields
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- Euclidean and Hermitian LCD MDS codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Galois LCD codes over finite fields
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- scientific article; zbMATH DE number 6765484 (Why is no real title available?)
- LCD codes over finite chain rings
- Linear codes with complementary duals
- Linear codes with one-dimensional hull associated with Gaussian sums
- Linear codes with small hulls in semi-primitive case
- New Characterization and Parametrization of LCD Codes
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Quasi-abelian codes
Cited in
(22)- Constructions and bounds on quaternary linear codes with Hermitian hull dimension one
- Hulls of linear codes revisited with applications
- Constructions of linear codes with small hulls from association schemes
- Codes with low-dimensional hull
- A new construction of linear codes with one-dimensional hull
- Galois hulls of linear codes over finite fields
- Linear codes with small hulls in semi-primitive case
- Optimal quaternary Hermitian LCD codes and their related codes
- MDS codes with euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs
- On Toeplitz codes of index \(t\) and isometry codes
- An improved method for constructing formally self-dual codes with small hulls
- Hulls of linear codes from simplex codes
- Linear codes and linear complementary pairs of codes over a non-chain ring
- Explicit non-special divisors of small degree, algebraic geometric hulls, and LCD codes from Kummer extensions
- New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes
- On abelian one-dimensional hull codes in group algebras
- On additive codes with one-rank hulls
- The dimensions of Galois hulls of linear codes derived from an improved propagation rule and related applications
- Asymptotically good four Toeplitz codes and derived new formally self-dual LCD codes
- Characterization and classification of optimal ternary linear one-dimensional hull codes
- Infinite families of linear codes over finite fields with new parameters and their hull dimensions
- Hull dimension of optimal binary LRCs with availability
This page was built for publication: A new method for constructing linear codes with small hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109389)
