On kernels and nuclei of rank metric codes
Abstract
For each rank metric code C⊂eq Km× n, we associate a translation structure, the kernel of which is shown to be invariant with respect to the equivalence on rank metric codes. When C is K-linear, we also propose and investigate other two invariants called its middle nucleus and right nucleus. When K is a finite field Fq and C is a maximum rank distance code with minimum distance d<\m,n\ or (m,n)=1, the kernel of the associated translation structure is proved to be Fq. Furthermore, we also show that the middle nucleus of a linear maximum rank distance code over Fq must be a finite field; its right nucleus also has to be a finite field under the condition \d,m-d+2\ ≥slant n2 +1. Let D be the DHO-set associated with a bilinear dimensional dual hyperoval over F2. The set D gives rise to a linear rank metric code, and we show that its kernel and right nucleus are is isomorphic to F2. Also, its middle nucleus must be a finite field containing Fq. Moreover, we also consider the kernel and the nuclei of Dk where k is a Knuth operation.
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.