MétaCan
Menu
Back to cohort
Record W1626906177 · doi:10.1109/tcomm.2015.2493063

Degraded Gaussian Diamond–Wiretap Channel

2015· article· en· W1626906177 on OpenAlexaff
Si-Hyeon Lee, Ashish Khisti

Bibliographic record

VenueIEEE Transactions on Communications · 2015
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsUniversity of Toronto
FundersQatar National Research Fund
KeywordsRandomnessRelayChannel (broadcasting)GaussianSecrecyUpper and lower boundsComputer scienceTopology (electrical circuits)Relay channelChannel codeEncoderCoding (social sciences)Constraint (computer-aided design)Computer networkDecoding methodsAlgorithmMathematicsCombinatoricsStatisticsPhysicsComputer security

Abstract

fetched live from OpenAlex

We establish upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel, and identify several ranges of channel parameters where these bounds coincide with useful intuitions. Furthermore, we investigate the effect of the presence of an eavesdropper on the capacity. We consider the following two scenarios: 1) common randomness is available at the source and the two relays and 2) randomness is available only at the source, and there is no randomness at the relays. Our upper bounds are established by taking into account the correlation between the two relay signals and the available randomness at the encoders, which generalize the techniques recently developed for the case without secrecy constraint. For the lower bounds, we propose two types of coding schemes: 1) decode-and-forward schemes where the relays cooperatively transmit the message and the fictitious message and 2) partial decode-and-forward schemes incorporated with multicoding in which each relay sends an independent partial message and the whole or partial fictitious message using dependent codewords.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.071
GPT teacher head0.282
Teacher spread0.212 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicWireless Communication Security TechniquesFrench-language works237,207