🔮
🔮
The Ethereal
On the dimension of twisted centralizer codes
July 20, 2016 · The Ethereal · 🏛 Finite Fields Their Appl.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
S. P. Glasby, Cheryl E. Praeger, Adel Alahmadi
arXiv ID
1607.05838
Category
math.CO: Combinatorics
Cross-listed
cs.IT,
math.AC
Citations
4
Venue
Finite Fields Their Appl.
Last Checked
6 months ago
Abstract
Given a field $F$, a scalar $λ\in F$ and a matrix $A\in F^{n\times n}$, the twisted centralizer code $C_F(A,λ):=\{B\in F^{n\times n}\mid AB-λBA=0\}$ is a linear code of length $n^2$. When $A$ is cyclic and $λ\ne0$ we prove that $\dim C_F(A,λ)=\mathrm{deg}(\gcd(c_A(t),λ^n c_A(λ^{-1}t)))$ where $c_A(t)$ denotes the characteristic polynomial of $A$. We also show how $C_F(A,λ)$ decomposes, and we estimate the probability that $C_F(A,λ)$ is nonzero when $|F|$ is finite. Finally, we prove $\dim C_F(A,λ)\leqslant n^2/2$ for $λ\not\in\{0,1\}$ and `almost all' matrices $A$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal