| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 724904 | The Journal of China Universities of Posts and Telecommunications | 2014 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Electrical and Electronic Engineering
