arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.01236math.CO
收藏

准无偏Hadamard矩阵和弱无偏Hadamard矩阵:一种编码理论方法

Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach

Makoto Araya, Masaaki Harada, Sho Suda

摘要:

本文研究了拟无偏Hadamard矩阵和弱无偏Hadamard矩阵,它们是无偏Hadamard矩阵的推广,等价无偏基。从编码理论的观点研究了这些矩阵。由于编码理论的方法,我们提供了相互准无偏阿达玛矩阵的数量上的上界。我们给出了适当长度的一类自互补码的分类。这些码给出了拟无偏Hadamard矩阵和弱无偏Hadamard矩阵。对弱无偏Hadamard矩阵的概念也作了一些修正。

英文摘要:

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 quasi-unbiased 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑