MétaCan
Menu
Back to cohort
Record W2061690338 · doi:10.1049/iet-com.2014.0535

On polar multiple description coding

2015· article· en· W2061690338 on OpenAlexafffund
Mehrdad Valipour, Shahram Yousefi

Bibliographic record

VenueIET Communications · 2015
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsQueen's UniversityUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsEncoderComputer sciencePolarPolar codeAlgorithmCoding (social sciences)Binary numberHamming distanceHamming codeVariable-length codeDecoding methodsNetwork packetMultiple description codingTheoretical computer scienceBlock codeComputer networkArithmeticMathematics

Abstract

fetched live from OpenAlex

The use of multiple description (MD) provides a reliable communications solution over packet loss channels; the polar source coding takes advantage of reasonable complexities in both the encoder and decoder sides. In this study, a polar MD coding is introduced for the binary input sequence with Hamming distortion in which the central decoder is aided by a common description from the encoder. The algorithm for code construction is studied. The performance evaluation demonstrates the effectiveness of the proposed system for MD with polar coding. In addition, the effects of design parameters have been studied.

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.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.143
GPT teacher head0.327
Teacher spread0.183 · 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 designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations2
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicError Correcting Code TechniquesFrench-language works237,207