Butson full propelinear codes
Jos\'e Andr\'es Armario, Ivan Bailera, Ronan Egan

TL;DR
This paper explores the structure and transformations of Butson Hadamard matrices and associated codes over finite rings, introducing new morphisms and demonstrating their properties and applications in coding theory.
Contribution
It introduces a new morphism for Butson Hadamard matrices via a generalized Gray map and shows how to construct larger matrices and codes with specific algebraic properties.
Findings
A new morphism for Butson Hadamard matrices is established.
A correspondence between additive codes over inite rings and BH-codes is demonstrated.
Structural properties of cocyclic BH-codes are analyzed.
Abstract
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of \'{O} Cath\'{a}in and Swartz. That is, we show how, if given a Butson Hadamard matrix over the roots of unity, we can construct a larger Butson matrix over the roots of unity for any dividing , provided that any prime dividing also divides . We prove that a -additive code with a prime number is isomorphic as a group to a BH-code over and the image of this BH-code under the Gray map is a BH-code over (binary Hadamard code for ). Further, we investigate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography
