MétaCan
Menu
Back to cohort
Record W2037978136 · doi:10.1049/iet-com.2014.0211

Performance of the generalised quantise‐and‐forward scheme over the multiple‐access relay channel

2014· article· en· W2037978136 on OpenAlexaff
Ming Lei, Mohammad Soleymani

Bibliographic record

VenueIET Communications · 2014
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsConcordia University
Fundersnot available
KeywordsRelayRelay channelChannel state informationComputer scienceChannel (broadcasting)GaussianAdditive white Gaussian noiseScheme (mathematics)Computer networkTopology (electrical circuits)AlgorithmTelecommunicationsWirelessMathematics

Abstract

fetched live from OpenAlex

In this study, the authors apply a generalised quantise‐and‐forward (GQF) relaying scheme for multiple access relay channel (MARC). The authors find achievable rate regions of GQF on MARC for both discrete memoryless case and additive white Gaussian channel. They assume that the relay has no access to channel state information (CSI) of the relay–destination link. Through numerical examples, they show that in the absence of CSI at the relay, the GQF scheme outperforms other relaying schemes. They also show that the outage probability of the individual users is lower than that of classic compress‐and‐forward scheme.

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 categoriesOpen science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.844
Threshold uncertainty score0.999

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0060.004
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.065
GPT teacher head0.305
Teacher spread0.239 · 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.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations2
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207