Linear complexity of quaternary sequences with odd period and low autocorrelation |
| |
| Authors: | KE Pin-hui LIN Chang-lu ZHANG Sheng-yuan |
| |
| Affiliation: | Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou 350007, China |
| |
| Abstract: | Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively. |
| |
| Keywords: | quaternary sequences linear complexity cyclotomy |
| 本文献已被 维普 ScienceDirect 等数据库收录！ |
