MétaCan
Menu
Back to cohort
Record W2207433731 · doi:10.1109/itwf.2015.7360789

The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper

2015· article· en· W2207433731 on OpenAlex
Kevin Luo, Ramy H. Gohary, Halim Yanıkömeroğlu

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 institutionsCarleton University
Fundersnot available
KeywordsJammingComputer scienceChannel (broadcasting)GaussianComputer networkComputer securityTelecommunicationsElectronic engineeringEngineeringPhysics

Abstract

fetched live from OpenAlex

A friendly eavesdropper assists communication in a broadcast scenario in which one transmitter wishes to send a common message to two receivers in the presence of a malicious jammer. The jammer attempts to disrupt communication by transmitting a high power Gaussian signal, whereas the friendly eavesdropper `hears' the jammer's transmission and sends an assisting signal to the destinations over an orthogonal channel in order to help them alleviate the jammer's impact. We derive an expression for capacity, i.e., the maximum data rate that can be reliably communicated from the transmitter to the receivers and we show that it is optimal for the friendly eavesdropper to send a Gaussian description of the jamming signal with the help of a scheme based on a modified compress-and-forward relaying that uses a list decoding procedure.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.427
Threshold uncertainty score0.197

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.022
GPT teacher head0.220
Teacher spread0.198 · 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