MétaCan
Menu
Back to cohort
Record W2131482164 · doi:10.1109/glocom.2005.1577651

Improved analysis of list decoding and its application to convolutional codes

2005· article· en· W2131482164 on OpenAlex
Chunlong Bai, Bartosz Mielczarek, I.J. Fair, Witold A. Krzymień

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
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsDecoding methodsCode wordConvolutional codeComputer scienceParity-check matrixSequential decodingList decodingAlgorithmCode (set theory)Linear codeSerial concatenated convolutional codesConcatenated error correction codeBlock codeTheoretical computer science

Abstract

fetched live from OpenAlex

In this paper, the concepts of effective weight enumerating function and generalized pairwise error event are introduced to predict the performance of linear block codes with list decoding. For the first time, a method to evaluate the actual effective codeword weights for a given code, rather than a lower bound on effective codeword weights, is proposed. Based on these actual effective codeword weights, the performance of a given code with list decoding can be predicted more accurately. We propose an analytical method to evaluate the performance of a given code with list decoding and consider terminated convolutional codes to show the validity of the analysis.

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 categoriesMeta-epidemiology (narrow)
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.735
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.018
GPT teacher head0.288
Teacher spread0.269 · 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