The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (Q894464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation |
scientific article; zbMATH DE number 6515015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation |
scientific article; zbMATH DE number 6515015 |
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
0 references
0 references
0.8814452886581421
0 references
0.8487938046455383
0 references
0.8472908735275269
0 references
0.8458398580551147
0 references
0.8415408134460449
0 references
