On the hull-variation problem of equivalent vector rank metric codes
Abstract
The intersection of a linear code with its dual is called the hull of the code. It is known that, for classical linear codes under the Hamming-metric, the dimension of the hull can be reduced up to equivalence. This phenomenon leads to the so-called hull-variation problem formulated by Hao Chen in 2023. In this paper, we consider the analogous problem for vector rank-metric codes, along with their associated matrix codes and extended block codes. Our results include the fact that every vector rank-metric code over any finite field Fq, in particular when q=2 or q=3, is equivalent to an LCD code.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.