关于Constantine一个结果的注记
Remark on a result of Constantine
Aalto University(阿尔托大学)
摘要:
在这个简短的说明中,我们构造代码的长度$4n$与$8n+8$码字和最小距离$2n-2$时,$4n+4$是阿达玛矩阵的顺序。这推广了Constantine在$n$是素数幂的特殊情况下得到的类似结果。
英文摘要:
In this short note we construct codes of length $4n$ with $8n+8$ codewords and minimum distance $2n-2$ whenever $4n+4$ is the order of a Hadamard matrix. This generalises work of Constantine who obtained a similar result in the special case that $n$ is a prime power.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。