Linear transformation codes: codes with a compact description and transpoliser codes (Q2024754)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7343540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear transformation codes: codes with a compact description and transpoliser codes |
scientific article; zbMATH DE number 7343540 |
Statements
Linear transformation codes: codes with a compact description and transpoliser codes (English)
0 references
4 May 2021
0 references
Summary: In this paper we define linear transformation codes, which provides a compact description to traditional codes. We divide them into ideal codes and multiplicative codes and show that the multiplicative codes are the more useful of the two. We relate them to linear and additive codes over non-commutative rings and show how to use the canonical orthogonals in each case to construct new codes. Extending on the specific examples of centraliser and twisted centraliser codes, we define a new family of codes, which we call transpoliser codes, that can be defined over the binary field without the restrictive upper bound on the minimum distance.
0 references
linear transformation codes
0 references
matrices
0 references
transpoliser codes
0 references
centraliser codes
0 references
Frobenius rings
0 references
0.8053117394447327
0 references
0.7595903873443604
0 references
0.7408136129379272
0 references
0.7368631362915039
0 references
