On the balancedness of nonlinear generators of binary sequences.
type: Item
instance of: scholarly article
title: On the balancedness of nonlinear generators of binary sequences.
zbMATH Open document ID: 1042.68043
DOI: 10.1016/S0020-0190(02)00349-6
author: Amparo Fúster-Sabater
author: Pedro García-Mochales
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
review text: A simple method of computing the number of 1's in the binary sequences obtained from combination generators has been developed. The procedure, which is based exclusively on the particular form of the combining function, can be applied to standard generators proposed and published in the open literature. As a straight consequence of this method, simple rules to design generators producing balanced (quasi-balanced) sequences are also derived.
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 1856508
zbMATH Keywords: Balancedness
zbMATH Keywords: LFSR-based generators
zbMATH Keywords: Minterm
zbMATH Keywords: Cryptography
MaRDI profile type: Publication
cites work: Q4146667
cites work: Q3803035
cites work: Q5202622
cites work: Q4718481
cites work: Linear Complexity and Random Sequences
full work available at URL: s0020-0190(02)00349-6
OpenAlex ID: W1989775066
description: scientific article; zbMATH DE number 1856508