Menichetti's nonassociative $G$-crossed product algebras and Menichetti codes
Abstract
We demonstrate the use of nonassociative algebras in code design and consider codes with nonassociative ambient algebras other than the well-known skew polycyclic codes. We define and investigate Menichetti algebras and identify them as important elements in the semiassociative Brauer monoid. Menichetti algebras can be viewed as generalisations of -crossed product algebras; they are -dimensional algebras with an -dimensional Galois field extension with Galois group in their nucleus. We then extend the class of linear error-correcting codes obtained from left principal ideals in their ambient algebra using the opposite algebras of Menichetti algebras as ambient algebra. With the right choice of algebra they display symmetric and cyclic properties which promise efficient decoding algorithms. Well-known examples of such Menichetti codes are those skew constacyclic codes which have a nonassociative -crossed product algebra (a nonassociative cyclic algebra) as their ambient algebra.
Keywords
Cite
@article{arxiv.2407.16256,
title = {Menichetti's nonassociative $G$-crossed product algebras and Menichetti codes},
author = {Susanne Pumpluen},
journal= {arXiv preprint arXiv:2407.16256},
year = {2025}
}
Comments
Title changed, section on linear error-correcting codes added, exposition improved overall