MétaCan
Menu
Back to cohort
Record W3211079129 · doi:10.1109/tit.2022.3150597

Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel

2022· article· en· W3211079129 on OpenAlexafffund
Ling-Hua Chang, Po‐Ning Chen, Fady Alajaji, Yunghsiang S. Han

Bibliographic record

VenueIEEE Transactions on Information Theory · 2022
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of CanadaMinistry of Science and Technology, Taiwan
KeywordsBinary symmetric channelDecoding methodsProbability of errorBinary numberMathematicsUpper and lower boundsChannel (broadcasting)AlgorithmContext (archaeology)CombinatoricsBinary erasure channelDiscrete mathematicsCoding (social sciences)Channel codeComputer scienceStatisticsChannel capacityTelecommunicationsArithmetic

Abstract

fetched live from OpenAlex

The generalized Poor-Verdú error lower bound established by Chang <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> (2020) for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence of block codes sent over the memoryless binary symmetric channel (BSC), the minimum probability of error (under maximum likelihood decoding) has a relative deviation from the generalized bound that grows at most linearly in blocklength. This result directly implies that for arbitrary codes used over the BSC, decoder ties can only affect the subexponential behavior of the minimum probability of error.

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 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 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.714
Threshold uncertainty score0.415

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.016
GPT teacher head0.230
Teacher spread0.214 · 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 teacher head, 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
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicWireless Communication Security TechniquesFrench-language works237,207