On the dimension of twisted centralizer codes
Abstract
Given a field F, a scalar λ∈ F and a matrix A∈ Fn× n, the twisted centralizer code CF(A,λ):=\B∈ Fn× n AB-λ BA=0\ is a linear code of length n2. When A is cyclic and λ0 we prove that CF(A,λ)=deg((cA(t),λn cA(λ-1t))) where cA(t) denotes the characteristic polynomial of A. We also show how CF(A,λ) decomposes, and we estimate the probability that CF(A,λ) is nonzero when |F| is finite. Finally, we prove CF(A,λ)≤slant n2/2 for λ∈\0,1\ and `almost all' matrices A.
0
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.