当前位置: X-MOL 学术Cryptogr. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
About the linear complexity of quaternary sequences with even length
Cryptography and Communications ( IF 1.2 ) Pub Date : 2019-12-14 , DOI: 10.1007/s12095-019-00419-w
Lu Zhao

Several classes of quaternary sequences of even period with optimal autocorrelation have been constructed by Su et al. based on interleaving certain kinds of binary sequences of odd period, i.e. Legendre sequence, twin-prime sequence and generalized GMW sequence. In this correspondence, the exact values of linear complexity over finite field \(\mathbb {F}_{4}\) and Galois ring \(\mathbb {Z}_{4}\) of the quaternary sequences are derived, respectively.

中文翻译:

关于偶数长度的四元序列的线性复杂度

Su等人已经构建了几类具有最佳自相关的偶数周期四元序列。基于交错奇数周期的某些二进制序列,即勒让德序列,双素数序列和广义GMW序列。在这种对应关系中,分别得出了四元数列的有限域\(\ mathbb {F} _ {4} \)和Galois环\(\ mathbb {Z} _ {4} \)上线性复杂度的精确值。
更新日期:2019-12-14
down
wechat
bug