Twisted centralizer codes

DOI10.1016/J.LAA.2017.03.011zbMATH Open1380.94141arXiv1608.04079OpenAlexW2964066802WikidataQ56987317 ScholiaQ56987317MaRDI QIDQ526293FDOQ526293

Patrick Solé, Adel Alahmadi, S. P. Glasby, Cheryl E. Praeger, Bahattin Yildiz

Publication date: 10 May 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Given an $nimesn$ matrix $A$ over a field $F$ and a scalar $ainF$, we consider the linear codes $C(A,a):=Bin{F}^{nimesn}mid,AB=aBA$ of length $n^2$. 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 $n^2$.

Full work available at URL: https://arxiv.org/abs/1608.04079

zbMATH Keywords

linear codesminimal distancegroup centralizersmatrix codes

Mathematics Subject Classification ID

Structure of finite commutative rings (13M05) Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Magma algebra system. I: The user language
• Searching for linear codes with large minimum distance
• Fundamentals of Error-Correcting Codes
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Some asymptotic results on finite vector spaces
• On the dimension of twisted centralizer codes
• Centraliser codes

Cited In (4)

• On decoding procedures of intertwining codes
• On bases and the dimensions of twisted centralizer codes
• On the dimension of twisted centralizer codes
• On the parameters of intertwining codes

Uses Software

• Code Tables

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)