Twisted centralizer codes

From MaRDI portal
(Redirected from Publication:526293)




Abstract: Given an nimesn matrix A over a field F and a scalar ainF, we consider the linear codes C(A,a):=BinFnimesnmid,AB=aBA of length n2. We call C(A,a) a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when a=1) is at most n, however for ae0,1 the minimal distance can be much larger, as large as n2.





Describes a project that uses

Uses Software





This page was built for publication: Twisted centralizer codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526293)