Linear Codes with Prescribed Hull Dimension and Minimum Distance
Abstract
The hull of a linear code (i.e., a finite field vector space)~\( C\) is defined to be the vector space formed by the intersection of~\( C\) with its dual~\( C.\) Constructing vector spaces with a specified hull dimension has important applications and it is therefore of interest to study minimum distance properties of such spaces. In this paper, we use the probabilistic method to obtain spaces with a given hull dimension and minimum distance and also derive Gilbert-Varshamov type sufficient conditions for their existence.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.