Partial decode-forward binning for full-duplex causal cognitive interference channels
Bibliographic record
Abstract
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".