English

On the dimension of twisted centralizer codes

Combinatorics 2017-07-17 v3 Information Theory Commutative Algebra math.IT

Abstract

Given a field FF, a scalar λF\lambda\in F and a matrix AFn×nA\in F^{n\times n}, the twisted centralizer code CF(A,λ):={BFn×nABλBA=0}C_F(A,\lambda):=\{B\in F^{n\times n}\mid AB-\lambda BA=0\} is a linear code of length n2n^2. When AA is cyclic and λ0\lambda\ne0 we prove that dimCF(A,λ)=deg(gcd(cA(t),λncA(λ1t)))\dim C_F(A,\lambda)=\mathrm{deg}(\gcd(c_A(t),\lambda^n c_A(\lambda^{-1}t))) where cA(t)c_A(t) denotes the characteristic polynomial of AA. We also show how CF(A,λ)C_F(A,\lambda) decomposes, and we estimate the probability that CF(A,λ)C_F(A,\lambda) is nonzero when F|F| is finite. Finally, we prove dimCF(A,λ)n2/2\dim C_F(A,\lambda)\leqslant n^2/2 for λ∉{0,1}\lambda\not\in\{0,1\} and `almost all' matrices AA.

Cite

@article{arxiv.1607.05838,
  title  = {On the dimension of twisted centralizer codes},
  author = {S. P. Glasby and Cheryl E. Praeger and Adel Alahmadi},
  journal= {arXiv preprint arXiv:1607.05838},
  year   = {2017}
}

Comments

17 pages, 2 figures Proof of Theorem 2.8 altered: last line and third last line changed

R2 v1 2026-06-22T14:59:09.683Z