CoChat

Signal Extraction from Chaotic Communications

Short, Kevin M. · 1997 · International Journal of Bifurcation and Chaos
Cited by 93

The DOI matches its Crossref record.

Abstract

This paper will consider the use of nonlinear dynamic (NLD) forecasting to extract messages from chaotic communication systems. Earlier work has shown that one-step prediction methods have sometimes been able to reveal the presence of hidden messages as well as the frequency content of the hidden messages. However, recovery of the actual hidden message usually involved filtering in the frequency domain. In this paper we show that it may be possible to extract the hidden message signal without filtering in the frequency domain. The approaches which will be discussed involve either the use of multi step predictions or a resumming process on the residuals after one-step prediction. For the multi step methods, two related approaches will be used. The first is primarily applicable to periodic signals, and will use the frequency information from one-step predictions to determine a block size to use for multi step predictions. The second will attempt dynamic detection of message signals using a windowed measure of the prediction error. For the resumming approach, it will be shown that even a lowest-order approximation can lead to faithful extraction of the hidden message signal for a ramping message signal that proved difficult in earlier work. These approaches will be applied to simple examples of communication schemes using signal masking and modulated chaos.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/s0218127497001230

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 93

Metadata

Authors
Short, K. M.
Venue
International Journal of Bifurcation and Chaos
Published
1997-07
Volume
07
Issue
07
Pages
1579-1597
ISSN
  • 0218-1274 (ISSN-L)
  • 1793-6551
OpenAlex
W2039024099
Cited by
93
References
0
FWCI
2.28
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: Signal Extraction from Chaotic Communications. https://app.cochat.ai/papers/10.1142/s0218127497001230
The paper
Short, K. M. (1997). Signal Extraction from Chaotic Communications. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127497001230

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.