The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Statistics of chaotic binary sequences
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Lasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353
Random numbers generated by linear recurrence modulo two
Tausworthe, R. C. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0184406-1 · Cited by 441
Invariant Distributions and Stationary Correlation Functions of One-Dimensional Discrete Processes
Grossmann, S., & Thomae, S. (1977) · Zeitschrift für Naturforschung A · doi:10.1515/zna-1977-1204 · Cited by 397
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Lewis, T. G., & Payne, W. H. (1973) · Journal of the ACM · doi:10.1145/321765.321777 · Cited by 312
An introduction to contemporary cryptology
Massey, J. L. (1988) · Proceedings of the IEEE · doi:10.1109/5.4440 · Cited by 253
Statistical Independence in Probability, Analysis, and Number Theory
Kac, M. (1959) · Carus Mathematical Monographs · doi:10.5948/upo9781614440123 · Cited by 246
On Combination of Stochastic and Deterministic Processes
Ulam, S. M. (1947) · Cited by 194
Statistical properties of chaos in Chebyshev maps
Geisel, T., & Fairén, V. (1984) · Physics Letters A · doi:10.1016/0375-9601(84)90993-9 · Cited by 134
On the Distribution of Values of Sums of the Type Σf(2 k t)
Kac, M. (1946) · Annals of Mathematics · doi:10.2307/1969033 · Cited by 118
Cited by
Cryptosystems with discretized chaotic maps
Masuda, N., & Aihara, K. (2002) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.974872 · Cited by 265
Cryptanalysis of a chaotic image encryption method
Li, S., & Zheng, X. (2003) · 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353) · doi:10.1109/iscas.2002.1011451 · Cited by 262
A novel block cryptosystem based on iterating a chaotic map
Xiang, T., Liao, X., Tang, G., Chen, Y., & Wong, K.-W. (2006) · Physics Letters A · doi:10.1016/j.physleta.2005.02.083 · Cited by 209
Metadata
- Authors
- Kohda, T., & Tsuneda, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1997
- Volume
- 43
- Issue
- 1
- Pages
- 104-112
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W1968971721
- Cited by
- 275
- References
- 12
- FWCI
- 8.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Statistics of chaotic binary sequences. https://app.cochat.ai/papers/10.1109/18.567654
- The paper
- Kohda, T., & Tsuneda, A. (1997). Statistics of chaotic binary sequences. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.567654
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
