On the Density of the Set of Known Hadamard Orders
Cryptography and communications(2010)
摘要
This bound is surprisingly hard to improve upon. We show that taking into account all the other major known construction methods for Hadamard matrices does not shift the bound. Our arguments use the notion of a (multiplicative) monoid of natural numbers. We prove some initial results concerning these objects. Our techniques may be useful when assessing the status of other existence questions in design theory.
更多查看译文
关键词
Hadamard matrices,Paley matrices,Asymptotic density of sets,Multiplicative functions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要