Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II (Q624254): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:16, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II |
scientific article |
Statements
Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II (English)
0 references
8 February 2011
0 references
The author looks at the structure of a family of binary sequences based on Galois fields of \(2\)-power order. In particular, results on linear complexity of a certain binary sequence are presented. The paper concludes with an argument that the pseudorandom measure found is a ``more convenient candidate to be the single measurement number of pseudorandomness'' than certain other options.
0 references
binary sequence
0 references
character sums
0 references
normality measure
0 references
pseudorandom binary sequences
0 references
