On the \(k\)-error linear complexity of binary sequences derived from polynomial quotients
On the \(k\)-error linear complexity of binary sequences derived from polynomial quotients
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
We investigate the \(k\)-error linear complexity of \(p^2\)-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~ \mathrm{with} 0 \le q_{p,w}(u) \le p-1, ~u\ge 0, $$ where \(p\) is an odd prime and \(1\le w
Alternative Titles
Full title
On the \(k\)-error linear complexity of binary sequences derived from polynomial quotients
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2078575149
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2078575149
Other Identifiers
E-ISSN
2331-8422
DOI
10.48550/arxiv.1307.6626
