Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10623-007-9134-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985421175 / rank | |||
Normal rank | |||
Revision as of 00:52, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm |
scientific article |
Statements
Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (English)
0 references
31 March 2009
0 references
