A new method for constructing linear codes with small hulls
From MaRDI portal
Publication:2109389
DOI10.1007/s10623-021-00940-1zbMath1506.94094arXiv2103.10874OpenAlexW3210710140MaRDI QIDQ2109389
Patrick Solé, Liqin Qian, Wei Lu, Xiwang Cao
Publication date: 21 December 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.10874
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Other character sums and Gauss sums (11T24)
Related Items (4)
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 ⋮ Optimal quaternary Hermitian LCD codes and their related codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Affine and projective planes
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Linear codes with complementary duals
- Galois LCD codes over finite fields
- Constructions of optimal LCD codes over large finite fields
- Euclidean and Hermitian LCD MDS codes
- Linear codes with one-dimensional hull associated with Gaussian sums
- Quasi-abelian codes
- Linear codes with small hulls in semi-primitive case
- LCD codes over finite chain rings
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- Computing automorphism groups of error-correcting codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Complementary Dual Algebraic Geometry Codes
- New Characterization and Parametrization of LCD Codes
- Constructions of Linear Codes With One-Dimensional Hull
- Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
This page was built for publication: A new method for constructing linear codes with small hulls
