Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xu, Xingxing, Shi, Minjia, Sole, Patrick
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2508.12859
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909740664094720
author Xu, Xingxing
Shi, Minjia
Sole, Patrick
author_facet Xu, Xingxing
Shi, Minjia
Sole, Patrick
contents Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson Hadamard codes for the homogeneous metric, a metric defined uniquely, up to scaling, for a commutative ring alphabet that is Quasi Frobenius. An upper bound is derived by an orthogonal array argument. A lower bound relies on the existence of bent sequences in the sense of (Shi et al. 2022). This latter bound generalizes a bound of (Armario et al. 2025) for the Hamming metric.
format Preprint
id arxiv_https___arxiv_org_abs_2508_12859
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The covering radius of Butson Hadamard codes for the homogeneous metric
Xu, Xingxing
Shi, Minjia
Sole, Patrick
Cryptography and Security
Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson Hadamard codes for the homogeneous metric, a metric defined uniquely, up to scaling, for a commutative ring alphabet that is Quasi Frobenius. An upper bound is derived by an orthogonal array argument. A lower bound relies on the existence of bent sequences in the sense of (Shi et al. 2022). This latter bound generalizes a bound of (Armario et al. 2025) for the Hamming metric.
title The covering radius of Butson Hadamard codes for the homogeneous metric
topic Cryptography and Security
url https://arxiv.org/abs/2508.12859