Twisted centralizer codes

Adel Alahmadi, Stephen Glasby, Cheryl Praeger, Patrick Sole, Bahattin Yildiz

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Given an n×n matrix A over a field F and a scalar a¿F, we consider the linear codes C(A,a):={B¿Fn×n|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 a¿0,1 the minimal distance can be much larger, as large as n2.
Original languageEnglish
Pages (from-to)235-249
Number of pages15
JournalLinear Algebra and Its Applications
Volume524
DOIs
Publication statusPublished - 1 Jul 2017

Fingerprint Dive into the research topics of 'Twisted centralizer codes'. Together they form a unique fingerprint.

  • Cite this

    Alahmadi, A., Glasby, S., Praeger, C., Sole, P., & Yildiz, B. (2017). Twisted centralizer codes. Linear Algebra and Its Applications, 524, 235-249. https://doi.org/10.1016/j.laa.2017.03.011