MétaCan
Menu
Back to cohort
Record W2164938435 · doi:10.1109/glocom.2005.1577874

Joint source-channel decoding of convolutionally encoded multiple-descriptions

2005· article· en· W2164938435 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

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsConvolutional codeComputer scienceDecoding methodsViterbi decoderViterbi algorithmAlgorithmSequential decodingTurbo codeBinary erasure channelSoft output Viterbi algorithmChannel (broadcasting)Serial concatenated convolutional codesTheoretical computer scienceConcatenated error correction codeTelecommunicationsChannel capacityBlock code

Abstract

fetched live from OpenAlex

The scenario considered in this paper is the transmission of a continuous information source over a set of erasure channels, by using a multiple description quantizer to deal with channel erasures and a convolutional channel code on each channel to deal with random bit errors. The diversity available in multiple descriptions is subsequently exploited in Viterbi sequence detectors to jointly decode the convolutional codes. Two approaches to joint decoding are presented and investigated. Simulation results are presented for two-channel multiple description quantization of Gaussian sources which demonstrate the potential improvements in end-to-end source distortion achievable with joint decoding of channel codes in a multiple description system. We also compare the performance of joint Viterbi detectors with that of turbo-style iterative decoding of multiple-description codes proposed earlier.

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.695
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0050.002
Research integrity0.0000.001
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.052
GPT teacher head0.292
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