MétaCan
Menu
Back to cohort
Record W3182656491 · doi:10.1109/lcomm.2021.3095895

Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity

2021· article· en· W3182656491 on OpenAlexafffund
Bo Lian, Frank R. Kschischang

Bibliographic record

VenueIEEE Communications Letters · 2021
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSequential decodingConvolutional codeDecoding methodsList decodingAlgorithmComputer scienceViterbi algorithmMetric (unit)Viterbi decoderSerial concatenated convolutional codesBlock codeTheoretical computer scienceConcatenated error correction code

Abstract

fetched live from OpenAlex

Sequential decoding of short length binary codes for the additive white Gaussian noise channel is considered. A variant of the variable-bias term (VBT) metric is introduced, producing useful trade-offs between performance and computational complexity. Comparisons are made with tail-biting convolutional codes decoded with a wrap-around Viterbi algorithm (WAVA) and with polar codes under successive-cancellation list (SCL) decoding. It is found that sequential decoding with the improved VBT metric has a better performance–complexity tradeoff than tail-biting codes under WAVA decoding (except at low complexities) but a worse performance–complexity tradeoff than polar codes under SCL decoding (except at high complexities).

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.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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.359
Threshold uncertainty score0.689

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.001
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.147
GPT teacher head0.345
Teacher spread0.199 · 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 designBench or experimental
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
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicError Correcting Code TechniquesFrench-language works237,207