On the dimension of twisted centralizer codes

Abstract: Given a field

F

, a scalar

l a m b d a i n F

and a matrix

A i n F^{n i m e s n}

, the twisted centralizer code

C_{F} (A, l a m b d a) := B i n F^{n i m e s n} m i d A B - l a m b d a B A = 0

is a linear code of length

n^{2}

. When

A

is cyclic and

l a m b d a e 0

we prove that

d i m C_{F} (A, l a m b d a) = m a t h r m d e g (g c d (c_{A} (t), l a m b d a^{n} c_{A} (l a m b d a^{- 1} t)))

where

c_{A} (t)

denotes the characteristic polynomial of

A

. We also show how

C_{F} (A, l a m b d a)

decomposes, and we estimate the probability that

C_{F} (A, l a m b d a)

is nonzero when

| F |

is finite. Finally, we prove

d i m C_{F} (A, l a m b d a) l e q s l a n t n^{2} / 2

for

l a m b d a o t i n 0, 1

and `almost all' matrices

A

.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: On the dimension of twisted centralizer codes