Statistics of chaotic binary sequences

Statistical properties of binary sequences generated by a class of ergodic maps with some symmetric properties are discussed on the basis of an ensemble-average technique. We give a simple sufficient condition for such a class of maps to produce a fair Bernoulli sequence, that is, a sequence of inde...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1997-01, Vol.43 (1), p.104-112
Main Authors: Kohda, T., Tsuneda, A.
Format: Article
Language:English
Subjects:
Application software
Binary sequences
Binary system
Chaos
Chaotic communication
Computer science
Digital communication
Extraterrestrial measurements
Information technology
Random variables
Statistics
Sufficient conditions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Statistical properties of binary sequences generated by a class of ergodic maps with some symmetric properties are discussed on the basis of an ensemble-average technique. We give a simple sufficient condition for such a class of maps to produce a fair Bernoulli sequence, that is, a sequence of independent and identically distributed (i.i.d.) binary random variables. This condition is expressed in terms of binary function, which is a generalized version of the Rademacher function for the dyadic map.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.567654