MétaCan
Menu
Back to cohort
Record W2078449661 · doi:10.1109/isit.2012.6283412

Partial decode-forward binning for full-duplex causal cognitive interference channels

2012· article· en· W2078449661 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 institutionsMcGill University
Fundersnot available
KeywordsComputer scienceDecoding methodsDirty paper codingCommunication sourceAlgorithmEncoderCode wordChannel (broadcasting)Coding (social sciences)DecodesTheoretical computer scienceMathematicsComputer networkPrecodingStatisticsMIMO

Abstract

fetched live from OpenAlex

The causal cognitive interference channel (CCIC) is a four-node channel, in which the second sender obtains information from the first sender causally and assists in the transmission of both. We propose a new coding scheme called Han-Kobayashi partial decode-forward binning (HK-PDF-binning), which combines the ideas of Han-Kobayashi coding, partial decode-forward relaying, conditional Gelfand-Pinsker binning and relaxed joint decoding. The second sender decodes a part of the message from the first sender, then uses Gelfand-Pinsker binning to bin against the decoded codeword. When applied to the Gaussian channel, this HK-PDF-binning essentializes to a correlation between the transmit signal and the state, which encompasses the traditional dirty-paper-coding binning as a special case when this correlation factor is zero. The proposed scheme encompasses the Han-Kobayashi rate region and achieves both partial decode-forward relaying rate for the first user and interference-free rate for the second user.

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: none
Teacher disagreement score0.684
Threshold uncertainty score0.645

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.041
GPT teacher head0.301
Teacher spread0.260 · 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