The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (Q894464): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q648067 |
Changed an Item |
||
| Property / author | |||
| Property / author: Vladimir Edemskiy / rank | |||
Normal rank | |||
Revision as of 11:46, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation |
scientific article |
Statements
The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (English)
0 references
1 December 2015
0 references
cryptography
0 references
linear complexity
0 references
binary sequences
0 references
