To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2pn |
|
Author |
Shimin Wei |
| Citation |
Vol. 8 No. 4 pp. 221-224 |
|
Abstract |
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence with period 2pn, where 2 is a primitive root modulo p2. The new algorithm is a generalization of an algorithm for computing the k-error linear complexity of a binary sequence with period pn presented by Wei, Chen, and Xiao. |
|
Keywords |
Cryptography, binary sequence, linear complexity, k-error linear complexity |
|
URL |
