← 研踪 PaperTrailarXiv:2611.19627 · v1
A Recursive Construction of Perfect and Odd Perfect Sequences of Unbounded Length over the Unit Quaternions
首次提交 2026-11-15 05:23
版本更新 2026-11-15 05:23
雷达观测 2026-11-17 12:06
摘要
We give a recursive construction, with closed-form index functions, of perfect and odd perfect periodic autocorrelation sequences over the eight simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ in every length . The sequences are built, as in the recursive perfect array construction of Blake, from \emph{twisted periodic extensions}: a short sequence continued with period up to a right factor $u\in\Qe$. Over roots of unity the twists cannot be regenerated by a one-dimensional recursion, consistently with Mow's conjecture; over $\Qe$ we show that no single sequence of length carries a twist or either, but that \emph{pairs} of sequences whose - and -twisted autocorrelations are complementary do. These -pairs behave exactly like Golay pairs: they double under interleaving with a right factor in place of a sign, every Golay pair of length gives an -pair of length , and they exist in length where no Golay pair exists. An -pair of length interleaves to an odd perfect sequence of length , and a perfect and an odd perfect sequence of length interleave to a perfect sequence of length with the array orthogonality property for the divisor . The -pairs of length are , where counts the changes in the bit string formed by and the binary digits of , and the odd perfect sequence of length is . The construction also gives odd perfect sequences over $\Qe$ in every length and perfect sequences in every length .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-15 05:23 · 最新观测版本
A Recursive Construction of Perfect and Odd Perfect Sequences of Unbounded Length over the Unit Quaternions
We give a recursive construction, with closed-form index functions, of perfect and odd perfect periodic autocorrelation sequences over the eight simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ in every length . The sequences are built, as in the recursive perfect array construction of Blake, from \emph{twisted periodic extensions}: a short sequence continued with period up to a right factor $u\in\Qe$. Over roots of unity the twists cannot be regenerated by a one-dimensional recursion, consistently with Mow's conjecture; over $\Qe$ we show that no single sequence of length carries a twist or either, but that \emph{pairs} of sequences whose - and -twisted autocorrelations are complementary do. These -pairs behave exactly like Golay pairs: they double under interleaving with a right factor in place of a sign, every Golay pair of length gives an -pair of length , and they exist in length where no Golay pair exists. An -pair of length interleaves to an odd perfect sequence of length , and a perfect and an odd perfect sequence of length interleave to a perfect sequence of length with the array orthogonality property for the divisor . The -pairs of length are , where counts the changes in the bit string formed by and the binary digits of , and the odd perfect sequence of length is . The construction also gives odd perfect sequences over $\Qe$ in every length and perfect sequences in every length .
查看此版本解读 →查看此版本原文 ↗