Abstract: Given an matrix over a field and a scalar , we consider the linear codes of length . We call 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 ) is at most , however for the minimal distance can be much larger, as large as .
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 637070 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Centraliser codes
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Fundamentals of Error-Correcting Codes
- On the dimension of twisted centralizer codes
- Searching for linear codes with large minimum distance
- Some asymptotic results on finite vector spaces
- The Magma algebra system. I: The user language
Cited in
(5)
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)