MétaCan
Menu
Back to cohort
Record W2057978321 · doi:10.1109/cnsr.2010.57

Network Coding in Two-Relay OFDMA Networks Using Re-initialized Transmission Scheme

2010· article· en· W2057978321 on OpenAlexaff
Hanhua Zhao, Jacek Ilow

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsDalhousie University
Fundersnot available
KeywordsLinear network codingComputer scienceRelayInitializationComputer networkSpectral efficiencyBroadcasting (networking)Coding (social sciences)Transmission (telecommunications)Scheme (mathematics)AlgorithmTelecommunicationsMathematicsNetwork packet

Abstract

fetched live from OpenAlex

This paper introduces a collaborative coding algorithm and re-initialized transmission scheme to improve spectral efficiency of two-relay OFDMA networks. By broadcasting the network coded frames through the shared sub-carriers, with specific network coding and frame recovery at each relay node (RN), the proposed algorithm provides 1/3 higher spectral efficiency than the conventional, store-and-forward, relaying scheme. The proposed algorithm suffers from the error propagations in the data recovery at the destinations. To control this effect, re-initialization into the transmission scheme is proposed.

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.831
Threshold uncertainty score0.754

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.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.057
GPT teacher head0.334
Teacher spread0.277 · 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

Citations4
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207