English

On Hull-Variation Problem of Equivalent Linear Codes

Information Theory 2022-11-29 v4 math.IT

Abstract

The intersection CC{\bf C}\bigcap {\bf C}^{\perp} (CCh{\bf C}\bigcap {\bf C}^{\perp_h}) of a linear code C{\bf C} and its Euclidean dual C{\bf C}^{\perp} (Hermitian dual Ch{\bf C}^{\perp_h}) is called the Euclidean (Hermitian) hull of this code. It is natural to consider the hull-variation problem when a linear code C{\bf C} is transformed to an equivalent code vC{\bf v} \cdot {\bf C}. 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 hh satisfying 0hn10 \leq h \leq n-1, a linear [2n,n]q[2n, n]_q self-dual code is equivalent to a linear hh-dimension hull code. On the opposite direction we prove that a linear LCD code over F2s{\bf F}_{2^s} satisfying d2d\geq 2 and d2d^{\perp} \geq 2 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 F3{\bf F}_3 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.

Keywords

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

R2 v1 2026-06-24T12:08:03.802Z