Improving the Bandwidth Efficiency of Multi-Terminal Satellite Communications
Bibliographic record
Abstract
This paper presents a new coding scheme that considerably increases the efficiency of the channel in multicast setting. Specifically, we study the scenario where three terminals exchange their messages via a satellite gateway. The main difference between the proposed scheme and conventional three-way relay channel is the use of joint channel and network coding. This allows three terminals to transmit simultaneously, therefore, reducing the number of time slots. In our scheme, the relay may either amplify and forward or de-noise and forward, whereas in the conventional scheme the relay decodes and performs bit-wise exclusive OR on the packets or simply decodes the bit-wise XOR of the two messages and broadcasts it to all terminals. So while conventional schemes assume a binary channel on the downlink, we assume a ternary channel on the downlink. Furthermore, while in the conventional scheme each terminal removes its own message from the downlink signal in order to recover the other terminal's message, in our scheme after removing its own message, a terminal can decode a second terminal's encoded message treating the third terminal message as interference and finally recover the third terminal's message interference-free. We show that our scheme achieves a total rate of 2.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".