MétaCan
Menu
Back to cohort
Record W2127451403 · doi:10.1109/icwc.1992.200720

A performance comparison of some combining schemes for finite-buffer ARQ systems in a Rayleigh-fading channel

2003· article· en· W2127451403 on OpenAlexaff
R. Cam, Cyril Leung, Charmaine Lam

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsAutomatic repeat requestRayleigh fadingComputer scienceFadingSelective Repeat ARQChannel (broadcasting)ThroughputDecoding methodsAlgorithmHybrid automatic repeat requestSelection (genetic algorithm)Computer networkWirelessTelecommunications linkTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

The throughput performance of a finite-buffer point-to-point ARQ system using multiple-copy decoding (MCD) is analyzed and compared for several hard-decision MCD techniques. Results are presented for a Rayleigh-fading channel model. Although MCD will, in general, improve the performance of an ARQ protocol, there are many possible MCD schemes. Selection of the 'best' scheme has to take into account cost and performance factors. The authors present a general survey of hard-decision MCD schemes that are likely to be considered in practice. A comparison of the relative merits of the different schemes is used to provide some practical guidelines to assist in the selection of the appropriate MCD scheme.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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

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.000
Open science0.0000.000
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.039
GPT teacher head0.268
Teacher spread0.229 · 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 designTheoretical or conceptual
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

Citations5
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207