Title | ||
---|---|---|
QUASI-UNBIASED HADAMARD MATRICES AND WEAKLY UNBIASED HADAMARD MATRICES: A CODING-THEORETIC APPROACH |
Abstract | ||
---|---|---|
This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of coding theory. As a consequence of a coding-theoretic approach, we provide upper bounds on the number of mutually quasiunbiased Hadamard matrices. We give classifications of a certain class of self-complementary codes for modest lengths. These codes give quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices. Some modification of the notion of weakly unbiased Hadamard matrices is also provided. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1090/mcom/3122 | MATHEMATICS OF COMPUTATION |
Keywords | DocType | Volume |
Unbiased Hadamard matrix,unbiased weighing matrix,self-complementary code | Journal | 86 |
Issue | ISSN | Citations |
304 | 0025-5718 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Makoto Araya | 1 | 26 | 8.52 |
Masaaki Harada | 2 | 367 | 69.47 |
Sho Suda | 3 | 29 | 9.82 |