English

Butson full propelinear codes

Information Theory 2020-11-30 v2 Combinatorics math.IT

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 kthk^{\rm th} roots of unity, we can construct a larger Butson matrix over the th\ell^{\rm th} roots of unity for any \ell dividing kk, provided that any prime pp dividing kk also divides \ell. We prove that a Zps\mathbb{Z}_{p^s}-additive code with pp a prime number is isomorphic as a group to a BH-code over Zps\mathbb{Z}_{p^s} and the image of this BH-code under the Gray map is a BH-code over Zp\mathbb{Z}_p (binary Hadamard code for p=2p=2). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided.

Cite

@article{arxiv.2010.06206,
  title  = {Butson full propelinear codes},
  author = {José Andrés Armario and Ivan Bailera and Ronan Egan},
  journal= {arXiv preprint arXiv:2010.06206},
  year   = {2020}
}

Comments

24 pages. Submitted to IEEE Transactions on Information Theory

R2 v1 2026-06-23T19:18:09.276Z