MétaCan
Menu
Back to cohort
Record W2089121566 · doi:10.1109/allerton.2011.6120198

Compress-forward without Wyner-Ziv binning for the one-way and two-way relay channels

2011· article· en· W2089121566 on OpenAlexaff
Peng Zhong, Mai Vu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMcGill University
Fundersnot available
KeywordsDecoding methodsRelayComputer scienceChannel (broadcasting)AlgorithmRelay channelCoding (social sciences)Data compressionGaussianTelecommunicationsMathematicsStatistics

Abstract

fetched live from OpenAlex

We consider the role of Wyner-Ziv binning in compress-forward for relay channels. In the one-way relay channel, we analyze a compress-forward scheme without Wyner- Ziv binning but with joint decoding of both the message and compression index. It achieves the same rate as the original compress-forward scheme with binning and successive decoding. Therefore, binning helps reduce decoding complexity by allowing successive decoding, but has no impact on achievable rate for the one-way relay channel. On the other hand, no binning simplifies relay operation. By extending compress-forward without binning to the two-way relay channel, we can achieve a larger rate region than the original compress-forward scheme when the channel is asymmetric for the two users. Binning and successive decoding limits the compression rate to match the weaker of the channels from relay to two users, whereas without binning, this restriction no longer applies. Compared with noisy network coding, compress-forward without binning achieves the same rate region in certain Gaussian channel configurations, and it has much less delay. This work is a step toward understanding the role of Wyner-Ziv binning in compress-forward relaying.

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 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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.933
Threshold uncertainty score0.429

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.001
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.125
GPT teacher head0.304
Teacher spread0.178 · 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 teacher head, not a consensus.

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

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

Citations10
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207