MétaCan
Menu
Back to cohort
Record W3086990738 · doi:10.1109/lcomm.2020.3023074

Reliable Broadcast Based on Online Fountain Codes

2020· article· en· W3086990738 on OpenAlexaff
Jingxuan Huang, Zesong Fei, Congzhe Cao, Ming Xiao, Xiang Xie

Bibliographic record

VenueIEEE Communications Letters · 2020
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsGlycemic Index LaboratoriesUniversity of Alberta
FundersNatural Science Foundation of Beijing MunicipalityChina Scholarship CouncilNational Natural Science Foundation of China
KeywordsFountain codeComputer scienceFountainDecoding methodsRaptor codeLuby transform codeScheme (mathematics)Code (set theory)WirelessTheoretical computer scienceAlgorithmComputer networkTelecommunicationsBlock codeConcatenated error correction codeMathematics

Abstract

fetched live from OpenAlex

In this letter, we study wireless broadcast schemes based on online fountain codes. We first propose and analyze an online fountain code based-broadcast scheme, where the coded symbol degree is updated based on the decoding states of all receivers. Then we propose and analyze an improved broadcast scheme by taking advantage of the received coded symbols that are not immediately decodable. Simulation results demonstrate that our proposed scheme has better performance compared to other broadcast schemes based on feedback fountain codes.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.063
GPT teacher head0.303
Teacher spread0.240 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations22
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicError Correcting Code TechniquesFrench-language works237,207