On Hull-Variation Problem of Equivalent Linear Codes
Hao Chen

TL;DR
This paper studies the hull-variation problem of linear codes under equivalence transformations, introduces the maximal hull dimension as an invariant, and constructs new families of codes including LCD, negacyclic, BCH, and quantum error-correcting codes.
Contribution
It introduces the maximal hull dimension as a new invariant and applies it to classify and construct various classes of codes, including MDS and EAQEC codes.
Findings
Linear codes with any hull dimension are characterized via equivalence.
New families of LCD negacyclic and BCH codes over ${\bf F}_3$ are constructed.
Several new entanglement-assisted quantum codes, including MDS and almost MDS, are developed.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Educational Methods and Media Use · Educational Curriculum and Learning Methods
