Name
Title | ||
|---|---|---|
Analysis Of The K-Error Linear Complexity And Error Sequence For 2p(N)-Periodic Binary Sequence |
Abstract | ||
|---|---|---|
The k-error linear complexity of a sequence is a fundamental concept for assessing the stability of the linear complexity. After computing the k-error linear complexity of a sequence, those bits that cause the linear complexity reduced also need to be determined. For binary sequences with period 2p(n), where p is an odd prime and 2 is a primitive root modulo p(2), we present an algorithm which computes the minimum number k such that the k-error linear complexity is not greater than a given constant c. The corresponding error sequence is also obtained. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transfun.E101.A.1197 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
periodic sequence, linear complexity, k-error linear complexity, error sequence | Journal | E101A |
Issue | ISSN | Citations |
8 | 1745-1337 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhihua Niu | 1 | 1 | 1.09 |
| Deyu Kong | 2 | 0 | 0.34 |
| Yanli Ren | 3 | 247 | 24.83 |
| Xiaoni Du | 4 | 0 | 0.34 |