Achievable Rates and Outer Bounds for Full-Duplex Relay Broadcast Channel with Side Message
Bibliographic record
Abstract
This paper examines the achievable rate region and the converse of a full-duplex relay broadcast channel with three independent messages: from the source to the relay, from the source to the destination, and from the relay to the destination. We are motivated to study this channel, because it models a full-duplex wireless cellular network in which the uplink user also wishes to send an independent device-to-device message to the downlink users. For the discrete memoryless channel case, we incorporate Marton's broadcast coding to obtain a new achievable rate region which is larger than previous rate regions. We further propose a tighter converse than the cut-set bound. For the Gaussian scalar channel case, we show that by using one of two rate-splitting schemes depending on the channel condition, we can already achieve the capacity region of this particular relay broadcast channel to within a constant gap. The proposed scheme outperforms the benchmark methods in terms of the symmetric generalized degree-of-freedom.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".