Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach
From MaRDI portal
Publication:2953215
DOI10.1090/mcom/3122zbMath1440.05051arXiv1504.01236OpenAlexW2300589161MaRDI QIDQ2953215
Makoto Araya, Masaaki Harada, Sho Suda
Publication date: 4 January 2017
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01236
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65) Combinatorial codes (94B25)
Related Items
Uses Software
Cites Work
- Mutually unbiased weighing matrices
- Unbiased complex Hadamard matrices and bases
- Weighing matrices and spherical codes
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- Orthogonal arrays. Theory and applications
- The Magma algebra system. I: The user language
- Classifying subspaces of Hamming spaces
- Mutually unbiased bush-type Hadamard matrices and association schemes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- On binary codes related to mutually quasi-unbiased weighing matrices
- Hadamard Matrices of Order 32
- Four fundamental parameters of a code and their combinatorial significance
- On antipodal spherical t-designs of degree s with $t\geq 2s-3$
- Hadamard matrices and their applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item