Some new symmetric Hadamard matrices

Q3 Mathematics
Dragomiru Z. Dokovic
{"title":"Some new symmetric Hadamard matrices","authors":"Dragomiru Z. Dokovic","doi":"10.31799/1684-8853-2022-2-2-10","DOIUrl":null,"url":null,"abstract":"Introduction: It is conjectured that the symmetric Hadamard matrices of order 4v exist for all odd integers v>0. In recent years, their existence has been proven for many new orders by using a special method known as the propus construction. This construction uses difference families Xk (k=1, 2, 3, 4) over the cyclic group Zv (integers mod v) with parameters (v; k1, k2, k3, k4; λ) where X1 is symmetric, X2=X3, and k1+2k2+k4=v+λ. It is also conjectured that such difference families (known as propus families) exist for all parameter sets mentioned above excluding the case when all the ki are equal. This new conjecture has been verified for all odd v≤53. Purpose: To construct many new symmetric Hadamard matrices by using the propus construction and to provide further support for the above-mentioned conjecture. Results: The first examples of symmetric Hadamard matrices of orders 4v are presented for v=127 and v=191. The systematic computer search for symmetric Hadamard matrices based on the propus construction has been extended to cover the cases v=55, 57, 59, 61, 63. Practical relevance: Hadamard matrices are used extensively in the problems of error-free coding, and compression and masking of video information.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatsionno-Upravliaiushchie Sistemy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31799/1684-8853-2022-2-2-10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction: It is conjectured that the symmetric Hadamard matrices of order 4v exist for all odd integers v>0. In recent years, their existence has been proven for many new orders by using a special method known as the propus construction. This construction uses difference families Xk (k=1, 2, 3, 4) over the cyclic group Zv (integers mod v) with parameters (v; k1, k2, k3, k4; λ) where X1 is symmetric, X2=X3, and k1+2k2+k4=v+λ. It is also conjectured that such difference families (known as propus families) exist for all parameter sets mentioned above excluding the case when all the ki are equal. This new conjecture has been verified for all odd v≤53. Purpose: To construct many new symmetric Hadamard matrices by using the propus construction and to provide further support for the above-mentioned conjecture. Results: The first examples of symmetric Hadamard matrices of orders 4v are presented for v=127 and v=191. The systematic computer search for symmetric Hadamard matrices based on the propus construction has been extended to cover the cases v=55, 57, 59, 61, 63. Practical relevance: Hadamard matrices are used extensively in the problems of error-free coding, and compression and masking of video information.
一些新的对称Hadamard矩阵
引言:对于所有的奇整数v>0,我们猜想4v阶对称Hadamard矩阵是存在的。近年来,通过使用一种称为propus构造的特殊方法,许多新订单已经证明了它们的存在。该构造在具有参数(v;k1,k2,k3,k4;λ)的循环群Zv(整数mod v)上使用差族Xk(k=1,2,3,4),其中X1是对称的,X2=X3,并且k1+2k2+k4=v+λ。还推测,除了所有ki相等的情况外,对于上述所有参数集都存在这样的差分族(称为propus族)。这一新猜想在所有奇数v≤53的情况下都得到了验证。目的:利用propus构造构造许多新的对称Hadamard矩阵,为上述猜想提供进一步的支持。结果:对于v=127和v=191,给出了4v阶对称Hadamard矩阵的第一个例子。基于propus构造的对称Hadamard矩阵的系统计算机搜索已经扩展到v=55,57,59,61,63的情况。实际相关性:阿达玛矩阵广泛用于视频信息的无差错编码、压缩和屏蔽问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Informatsionno-Upravliaiushchie Sistemy
Informatsionno-Upravliaiushchie Sistemy Mathematics-Control and Optimization
CiteScore
1.40
自引率
0.00%
发文量
35
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信