Back to Search
Start Over
Constructions of Linear Codes With One-Dimensional Hull.
- Source :
- IEEE Transactions on Information Theory; Mar2019, Vol. 65 Issue 3, p1668-1676, 9p
- Publication Year :
- 2019
-
Abstract
- The hull of a linear code is defined to be the intersection of the code and its dual, and was originally introduced to classify finite projective planes. The hull plays an important role in determining the complexity of algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code. It has been shown that these algorithms are very effective in general if the size of the hull is small. The objective of this paper is to present some sufficient and necessary conditions that linear codes and cyclic codes have one-dimensional hull. It is shown that there are no such binary or ternary cyclic codes. Based on these characterizations, some constructions of linear codes with one-dimensional hull were given by employing quadratic number fields, partial difference sets, and difference sets. We also construct cyclic codes with one-dimensional hull. Some optimal codes with one-dimensional hull are obtained. [ABSTRACT FROM AUTHOR]
- Subjects :
- LINEAR codes
CYCLIC codes
AUTOMORPHISMS
POLYNOMIALS
ABELIAN groups
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 65
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 134886963
- Full Text :
- https://doi.org/10.1109/TIT.2018.2863693