On Complete Morphisms of Butson Hadamard Matrices

ABSTRACT A complete morphism of Butson classes replaces each entry of a matrix in by an block, uniformly, to produce a matrix in . We show that every complete morphism is described by a pair , where and is a unitary matrix annihilated by the cyclotomic polynomial. We deduce from a theorem of Lam and Leung that complete morphisms onto real Hadamard matrices exist precisely when is a power of 2. The exponent‐reducing morphisms of Östergård–Paavola and Ó Catháin–Swartz achieve the smallest block size the degree bound allows, and we show that there are no other complete morphisms for which is monomial. We construct new complete morphisms where is not monomial: a complete morphism is given, the first to eliminate a prime from the alphabet.

Authors

Institutions

Publication Details

Journal
Journal of Combinatorial Designs
Published
2026-11-02
DOI
https://doi.org/10.1002/jcd.70047
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Complete Morphisms of Butson Hadamard Matrices

Padraig Ó Catháin, Ronan Egan
Journal of Combinatorial Designs
Coding theory and cryptography
article

On Complete Morphisms of Butson Hadamard Matrices

Padraig Ó Catháin, Ronan Egan
article en

Abstract

ABSTRACT A complete morphism of Butson classes replaces each entry of a matrix in by an block, uniformly, to produce a matrix in . We show that every complete morphism is described by a pair , where and is a unitary matrix annihilated by the cyclotomic polynomial. We deduce from a theorem of Lam and Leung that complete morphisms onto real Hadamard matrices exist precisely when is a power of 2. The exponent‐reducing morphisms of Östergård–Paavola and Ó Catháin–Swartz achieve the smallest block size the degree bound allows, and we show that there are no other complete morphisms for which is monomial. We construct new complete morphisms where is not monomial: a complete morphism is given, the first to eliminate a prime from the alphabet.

Journal of Combinatorial Designs
Dublin City University (IE)
Openalex Percentile: Top 21%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon