Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
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.
scientific article; zbMATH DE number 5848625