The covering radius of Butson Hadamard codes for the homogeneous metric

• URL: http://arxiv.org/abs/2508.12859v1
• Date: Mon, 18 Aug 2025 11:57:15 GMT
• Title: The covering radius of Butson Hadamard codes for the homogeneous metric
• Abstract summary: 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.
• Score: 12.1664680910466
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: 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.

Related papers

• GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding [54.10836630612739]
  GPTQ, or equivalently Babai's nearest plane algorithm, rounds a real matrix to integers under a quadratic metric.<n>We present GPTQ-2D, which produces the identical rounded matrix in cubic time.
  arXiv  Detail & Related papers  (2026-07-29T15:34:00Z)
• Quaternionic Perfect Sequences and Hadamard Matrices [5.16116932975802]
  We study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in Williamson's construction of quaternion-type Hadamard matrices.<n>We implement our algorithm and use it to enumerate all circulant and possibly non-symmetric Williamson-type matrices of orders up to 21.
  arXiv  Detail & Related papers  (2026-01-29T21:27:19Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• A Construction of Quantum Stabilizer Codes from Classical Codes and Butson Hadamard Matrices [0.0]
  We show that if there exist a classical linear code C is a subset of F_qn of dimension k, then there exists an [[nm, ks, d]]_q quantum stabilizer code with d determined by C and D. We consider the same construction of a quantum code for a general normalized Butson Hadamard matrix and search for a condition for the quantum code to be a stabilizer code.
  arXiv  Detail & Related papers  (2024-07-18T14:00:38Z)
• Butson Hadamard matrices, bent sequences, and spherical codes [15.98720468046758]
  We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $qth$ roots of unity. In particular we construct self-dual bent sequences for various $qle 60$ and lengths $nle 21.$ construction methods comprise the resolution of systems by Groebner bases and eigenspace computations.
  arXiv  Detail & Related papers  (2023-11-01T08:03:11Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Towards a conjecture on a special class of matrices over commutative rings of characteristic 2 [0.1813006808606333]
  We prove the conjecture posed by Keller and Rosemarin at Eurocrypt 2021 on the nullity of a matrix of a block matrix with Hadamard type blocks. We also reveal the structure formed by Hadamard over commutative rings from the perspectives of group algebra and algebra.
  arXiv  Detail & Related papers  (2021-12-26T09:39:32Z)
• The geometry of Hermitian self-orthogonal codes [0.7614628596146599]
  We prove that truncations of linear codes to codes equivalent to Hermitian self-orthogonal linear codes occur when the columns of a generator matrix of the code do not impose independent conditions on the space of Hermitian forms.
  arXiv  Detail & Related papers  (2021-08-18T11:07:13Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• Complex Hadamard Diagonalisable Graphs [0.0]
  We show that a large class of complex Hadamard diagonalisable graphs have sets forming an equitable partition. We provide examples and constructions of complex Hadamard diagonalisable graphs. We discuss necessary and sufficient conditions for $(alpha, beta)$--Laplacian fractional revival and perfect state transfer.
  arXiv  Detail & Related papers  (2020-01-01T17:49:25Z)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
  We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
  arXiv  Detail & Related papers  (2015-04-26T13:12:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.