MétaCan
Menu
Back to cohort
Record W2168970974 · doi:10.1109/isit.2010.5513792

Unequal error protection rateless coding design for multimedia multicasting

2010· article· en· W2168970974 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
TopicError Correcting Code Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceMulticastQuality of serviceEncoderComputer networkFountain codeCoding (social sciences)Code (set theory)Online codesRaptor codeForward error correctionDecoding methodsTheoretical computer scienceAlgorithmBlock codeLinear codeMathematics

Abstract

fetched live from OpenAlex

We study the design and optimization of unequal error protection (UEP) rateless codes for scalable multimedia multicasting. We formulate two general problems of optimizing UEP rateless code for multimedia multicasting to heterogenous users: one focusing on providing guaranteed quality of service (QoS) and the other focusing on providing best-effort QoS. A random interleaved rateless encoder design is proposed. Unlike previous designs, existing standardized raptor codes can be directly applied to this design without degrading performance. For each problem, optimal layer selection parameters are obtained either analytically or numerically. Numerical results demonstrate that the proposed optimized random interleaved UEP rateless code outperforms non-optimized rateless codes and recently proposed UEP rateless 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.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.722
Threshold uncertainty score0.595

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.095
GPT teacher head0.321
Teacher spread0.227 · 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

Quick stats

Citations16
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicError Correcting Code TechniquesFrench-language works237,207