<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1007/s10623-022-01110-7</dc:identifier><dc:language>eng</dc:language><dc:creator>Armario, José Andrés</dc:creator><dc:creator>Bailera, Ivan</dc:creator><dc:creator>Egan, Ronan</dc:creator><dc:title>Butson full propelinear codes</dc:title><dc:identifier>ART-2022-130844</dc:identifier><dc:description>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 Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the kth roots of unity, we can construct a larger Butson matrix over the ℓth roots of unity for any ℓ dividing k, provided that any prime p dividing k also divides ℓ. We prove that a Zps-additive code with p a prime number is isomorphic as a group to a BH-code over Zps and the image of this BH-code under the Gray map is a BH-code over Zp (binary Hadamard code for p=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.</dc:description><dc:date>2022</dc:date><dc:source>http://zaguan.unizar.es/record/120061</dc:source><dc:doi>10.1007/s10623-022-01110-7</dc:doi><dc:identifier>http://zaguan.unizar.es/record/120061</dc:identifier><dc:identifier>oai:zaguan.unizar.es:120061</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/AEI/PID2019-104664GB-I00</dc:relation><dc:identifier.citation>DESIGNS CODES AND CRYPTOGRAPHY 91 (2022), 333–351</dc:identifier.citation><dc:rights>by</dc:rights><dc:rights>http://creativecommons.org/licenses/by/3.0/es/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>