MétaCan
Menu
Back to cohort
Record W2149792368 · doi:10.1109/isit.2010.5513275

On the error exponent to redundancy ratio of interactive encoding and decoding

2010· article· en· W2149792368 on OpenAlexaff
Jin Meng, En‐hui Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDecoding methodsExponentRedundancy (engineering)Encoding (memory)Computer scienceCoding (social sciences)AlgorithmProbability of errorErgodic theoryLow-density parity-check codeSource codeTheoretical computer scienceError detection and correctionDiscrete mathematicsMathematicsStatisticsArtificial intelligencePure mathematics

Abstract

fetched live from OpenAlex

The concept of error exponent to redundancy ratio (EERR) of interactive encoding and decoding (IED), as well as Slepian-Wolf coding (SWC), is defined and investigated in this paper. The EERR of universal IED is determined. In the non-universal coding case, it is shown that for any stationary ergodic source-side information pair, a two stage IED scheme with 3 rounds of interactions or less can be constructed such that its EERR ≥1. Meanwhile, for any memoryless source-side information pair, the EERR of SWC is strictly less than 1 in the region where the error exponent of SWC is determined. Furthermore, practical two stage IED schemes are proposed and implemented by using LDPC codes and Belief Propagation (BP) Decoding, and simulation shows that the error probability of the proposed two stage IED schemes is indeed significantly lower than that of SWC schemes.

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.004
metaresearch head score (Gemma)0.034
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: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.034
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.001
Science and technology studies0.0000.003
Scholarly communication0.0010.003
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.018
GPT teacher head0.272
Teacher spread0.253 · 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
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

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207