MétaCan
Menu
Back to cohort
Record W3106800228 · doi:10.1109/lcomm.2020.3039436

Low-Complexity Coding and Spreading for Unsourced Random Access

2020· article· en· W3106800228 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Communications Letters · 2020
Typearticle
Languageen
FieldEngineering
TopicIoT Networks and Protocols
Canadian institutionsDalhousie University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceRandom accessAlgorithmCoding (social sciences)Permutation (music)Payload (computing)Reduction (mathematics)Interference (communication)Transmission (telecommunications)Computational complexity theoryTheoretical computer scienceComputer networkMathematicsTelecommunications

Abstract

fetched live from OpenAlex

We propose a low-complexity unsourced random access (URA) transmission scheme where the data payload, encoded by an error-reduction code, undergoes repetition, permutation, and spreading. An approach to perform spatial graph coupling of the URA messages via randomized message delays is also presented. The proposed system, in either block or coupled form, outperforms the existing URA counterparts in the high multi-user interference regime and provides a substantial increase in the supported multi-user loads. A choice of stronger, albeit more complex, error-correction code allows for performance improvements at lower system loads. Finally, system performance predictions via a state-evolution analysis are also demonstrated.

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.000
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: Empirical · Consensus signal: none
Teacher disagreement score0.865
Threshold uncertainty score0.462

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.106
GPT teacher head0.313
Teacher spread0.207 · 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