MétaCan
Menu
Back to cohort
Record W2026520051 · doi:10.1109/icc.2010.5502232

Cooperative Relay Communication Performance under Spectrum-Sharing Resource Requirements

2010· article· en· W2026520051 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsRelayComputer scienceComputer networkBandwidth (computing)Interference (communication)Shared resourceTransmission (telecommunications)Context (archaeology)Spectral efficiencyResource (disambiguation)TelecommunicationsPower (physics)

Abstract

fetched live from OpenAlex

We propose using cooperative relaying technique in spectrum-sharing systems to more effectively and efficiently use the available transmission resources, such as power, rate and bandwidth, while adhering to the spectrum-sharing resource requirements of the licensed (primary) user. Specifically, we consider that the secondary user of the spectrum is assisted by a decode-and-forward (DF) relay to help in the communication between its source and destination nodes. In this context, we obtain the end-to-end performance of the proposed spectrum-sharing cooperative relaying system in terms of the average symbol error rate (SER) of the secondary's communication under appropriate constraints on the interference power at the primary receiver. We further analyze our theoretical results through simulations and comparisons illustrating the SER performance of the proposed spectrum-sharing cooperative system for different operating scenarios.

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.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.935
Threshold uncertainty score0.530

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.001
Open science0.0020.001
Research integrity0.0000.001
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.048
GPT teacher head0.292
Teacher spread0.244 · 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