MétaCan
Menu
Back to cohort
Record W2102842712 · doi:10.1109/icassp.1989.266392

Combined source-channel coding

2003· article· en· W2102842712 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

VenueInternational Conference on Acoustics, Speech, and Signal Processing · 2003
Typearticle
Languageen
FieldComputer Science
TopicAlgorithms and Data Compression
Canadian institutionsMcGill University
Fundersnot available
KeywordsEncoderBinary numberBinary symmetric channelComputer scienceCoding (social sciences)AlgorithmChannel codeBCH codeChannel (broadcasting)Source codeVariable-length codeDecoding methodsBinary codeTheoretical computer scienceMathematicsArithmeticTelecommunicationsStatisticsProgramming language

Abstract

fetched live from OpenAlex

An approach to combined source-channel coding is presented. The method applies to a scalar source encoder designed using the Lloyd-Max algorithm and uses a family of binary primitive BCH codes. The channel model used is the binary symmetric channel. A variety of experimental results are presented which illustrate the average signal-to-noise ratio gain possible over no channel coding when different numbers of source encoder output bits are protected and the overall rate is held fixed. A number of interesting conclusions are drawn which can prove helpful in attempting to match existing source and channel coding techniques.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.000
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.967
Threshold uncertainty score0.703

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.037
GPT teacher head0.275
Teacher spread0.238 · 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