MétaCan
Menu
Back to cohort
Record W2067786666 · doi:10.1109/bsc.2010.5472918

Error correction codes for secure chaos-based communication system

2010· article· en· W2067786666 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicChaos control and synchronization
Canadian institutionsCanadian Institute for International Peace and Security
Fundersnot available
KeywordsComputer scienceChaoticDemodulationViterbi algorithmError detection and correctionSynchronization (alternating current)Communications systemDecoding methodsViterbi decoderAlgorithmSynchronization of chaosCoding (social sciences)CHAOS (operating system)Sequence (biology)Block (permutation group theory)Theoretical computer scienceControl theory (sociology)TelecommunicationsMathematicsArtificial intelligenceChannel (broadcasting)Computer security

Abstract

fetched live from OpenAlex

Since many chaotic communication systems presented in the literature show a poor performance or a weak chaotic synchronization in noisy environments, in this paper we present a new chaotic communication system with high performance and robust demodulation process. This system is based on the chaotic symbolic sequence with an error correction coding block. On the receiver side, a Viterbi algorithm is used to estimate the chaotic sequence followed by an error decoding block. This proposed system gives a good performance with high security of transmission without any need for chaos synchronization.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.953
Threshold uncertainty score0.273

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.240
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations16
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicChaos control and synchronizationFrench-language works237,207