Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
type: Item
instance of: scholarly article
title: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
zbMATH Open document ID: 1224.68030
author: János Folláth
published in: Periodica Mathematica Hungarica
publication date: 2011-02-08T00:00:00Z
review text: 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.
reviewed by: Richard A. Mollin
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 11T23
zbMATH DE Number: 5848625
zbMATH Keywords: binary sequence
zbMATH Keywords: character sums
zbMATH Keywords: normality measure
zbMATH Keywords: pseudorandom binary sequences
MaRDI profile type: Publication
full work available at URL: s10998-010-2127-y
OpenAlex ID: W1985587200
cites work: A complexity measure for families of binary sequences
cites work: Q3436150
cites work: Linear complexity profile of binary sequences with small correlation measure
cites work: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
cites work: Construction of large families of pseudorandom binary sequences
cites work: Concatenation of pseudorandom binary sequences
cites work: Q2708612
cites work: Q3509721
cites work: Q4146667
cites work: On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
cites work: Collision and avalanche effect in families of pseudorandom binary sequences
DOI: 10.1007/S10998-010-2127-Y
description: scientific article; zbMATH DE number 5848625