MétaCan
Menu
← Back to cohort
Record W4366717779 · doi:10.48550/arxiv.1007.1735

Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and\n Optimality

2010· preprint· W4366717779 on OpenAlexaff
Ahmed Noah Badr, Ashish Khisti, Emin Martinian

Bibliographic record

VenuearXiv (Cornell University) · 2010
Typepreprint
Language
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsErasureComputer scienceErasure codeBinary erasure channelOnline codesComputer networkMulticastChannel (broadcasting)Network packetDecoding methodsTelecommunicationsChannel capacityBlock codeConcatenated error correction code

Abstract

fetched live from OpenAlex

Streaming erasure codes encode a source stream to guarantee that each source\npacket is recovered within a fixed delay at the receiver over a burst-erasure\nchannel. This paper introduces diversity embedded streaming erasure codes\n(DE-SCo), that provide a flexible tradeoff between the channel quality and\nreceiver delay. When the channel conditions are good, the source stream is\nrecovered with a low delay, whereas when the channel conditions are poor the\nsource stream is still recovered, albeit with a larger delay. Information\ntheoretic analysis of the underlying burst-erasure broadcast channel reveals\nthat DE-SCo achieve the minimum possible delay for the weaker user, without\nsacrificing the performance of the stronger user. A larger class of multicast\nstreaming erasure codes (MU-SCo) that achieve optimal tradeoff between rate,\ndelay and erasure-burst length is also constructed.\n

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.006
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.002
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.105
GPT teacher head0.222
Teacher spread0.117 · 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
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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)→Same topicCooperative Communication and Network Coding→French-language works237,207→