MétaCan
Menu
Back to cohort

Secure Transmission in OFDM Systems by Using Time Domain Scrambling

2013· article· en· W2089373874 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
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingSubcarrierScramblingComputer scienceTime domainAdditive white Gaussian noiseTransmission (telecommunications)Frequency domainSecure transmissionChannel (broadcasting)Electronic engineeringAlgorithmComputer networkTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

In order to improve the confidentiality and security of orthogonal frequency division multiplexing (OFDM) systems, a physical layer security enhancement scheme by using time domain scrambling techniques is proposed in this paper. The approach is based on secretly scrambling the sample sequence within each time domain OFDM symbol, which is equivalent to constellation transformation over each subcarrier in the frequency domain. Consequently, the unique signal characteristics of the standardized OFDM transmission can be removed. The efficacy of the security enhancement is analyzed by means of the secrecy capacity. Moreover, related simulation results under the AWGN and the Rayleigh channel models indicate that our proposed scheme can improve the system secrecy significantly and the corresponding system performance will not be degraded.

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: Empirical
Teacher disagreement score0.957
Threshold uncertainty score0.485

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.010
GPT teacher head0.223
Teacher spread0.213 · 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