On Hull-Variation Problem of Equivalent Linear Codes
Abstract
The intersection () of a linear code and its Euclidean dual (Hermitian dual ) is called the Euclidean (Hermitian) hull of this code. It is natural to consider the hull-variation problem when a linear code is transformed to an equivalent code . In this paper we introduce the maximal hull dimension as an invariant of a linear code with respect to the equivalent transformations. Then some basic properties of the maximal hull dimension are studied. We prove that for a nonnegative integer satisfying , a linear self-dual code is equivalent to a linear -dimension hull code. On the opposite direction we prove that a linear LCD code over satisfying and is equivalent to a linear one-dimension hull code under a weak condition. Several new families of LCD negacyclic codes and LCD BCH codes over are also constructed. Our method can be applied to the generalized Reed-Solomon codes and the generalized twisted Reed-Solomon codes to construct arbitrary dimension hull MDS codes. Some new entanglement-assisted quantum error-correction (EAQEC) codes including MDS and almost MDS EAQEC codes are constructed. Many EAQEC codes over small fields are constructed from optimal Hermitian self-dual codes.
Cite
@article{arxiv.2206.14516,
title = {On Hull-Variation Problem of Equivalent Linear Codes},
author = {Hao Chen},
journal= {arXiv preprint arXiv:2206.14516},
year = {2022}
}
Comments
34 pages, revised version