A generalisation of bent vectors for Butson Hadamard matrices

December 21, 2024 ยท The Ethereal ยท ๐Ÿ› arXiv.org

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Josรฉ Andrรฉs Armario, Ronan Egan, Hadi Kharaghani, Padraig ร“ Cathรกin arXiv ID 2412.16579 Category math.CO: Combinatorics Cross-listed cs.IT Citations 2 Venue arXiv.org Last Checked 3 months ago
Abstract
An $n\times n$ complex matrix $M$ with entries in the $k^{\textrm{th}}$ roots of unity which satisfies $MM^{\ast} = nI_{n}$ is called a Butson Hadamard matrix. While a matrix with entries in the $k^{\textrm{th}}$ roots typically does not have an eigenvector with entries in the same set, such vectors and their generalisations turn out to have multiple applications. A bent vector for $M$ satisfies $M{\bf x} = ฮป{\bf y}$ where ${\bf x}$ has entries in the $k^{\textrm{th}}$ roots of unity and all entries of $\textbf{y}$ are complex numbers of norm $1$. Such a bent vector ${\bf x}$ is self-dual if ${\bf y} = ฮผ{\bf x}$ and conjugate self-dual if ${\bf y} = ฮผ\overline{\bf x}$ for some $ฮผ$ of norm $1$. Using techniques from algebraic number theory, we prove some order conditions and non-existence results for self-dual and conjugate self-dual bent vectors; using tensor constructions and Bush-type matrices we give explicit examples. We conclude with an application to the covering radius of certain non-linear codes generalising the Reed Muller codes.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Combinatorics

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO ๐Ÿ› arXiv ๐Ÿ“š 94 cites 10 years ago