MétaCan
Menu
Back to cohort
Record W2151614040 · doi:10.1109/cwit.2007.375706

Rank-Metric Codes for Priority Encoding Transmission with Network Coding

2007· article· en· W2151614040 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
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceLinear network codingNetwork packetCoding (social sciences)Encoding (memory)Computer networkTheoretical computer scienceBroadcasting (networking)Packet lossDistributed computingForward error correctionAlgorithmDecoding methodsMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

The idea of priority encoding transmission (PET), although very useful to provide graceful degradation of performance in the presence of packet loss, presents a challenge when one tries to apply it in a random network coding environment. So far, the only solution proposed relies on the rateless feature of network coding and is therefore not suitable for delay-constrained applications. In this paper, a PET system based on rank-metric codes is proposed. This system can provide strict combinatorial guarantees of recovery. The system is also able to provide forward error correction of corrupt packets that could potentially be introduced by malicious users. Application of the system to streaming media broadcasting is proposed, illustrating the potential practical utility of this approach.

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.002
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: Methods · Consensus signal: none
Teacher disagreement score0.704
Threshold uncertainty score0.447

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.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.036
GPT teacher head0.297
Teacher spread0.261 · 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