MétaCan
Menu
Back to cohort
Record W2121122045 · doi:10.1109/ccece.2003.1226223

Soft Reed-Solomon decoding for concatenated codes

2004· article· en· W2121122045 on OpenAlexaff
S. Panigrahi, Leszek Szczeciński, Fabrice Labeau

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsMcGill UniversityUniversité du QuébecInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsDecoding methodsConvolutional codeSequential decodingConcatenated error correction codeAlgorithmSerial concatenated convolutional codesComputer scienceList decodingAdditive white Gaussian noiseReed–Solomon error correctionTurbo codeBlock Error RateBlock codeChannel (broadcasting)Telecommunications

Abstract

fetched live from OpenAlex

This paper analyzes two soft-input Reed-Solomon (RS) decoding methods, generalized minimum distance (GMD) decoding and the chase-GMD algorithm (CGA), applying them to concatenated codes. Using as an example an encoding scheme combining convolutional and RS encoders, the performance of different decoding approaches is evaluated in AWGN and Rayleigh channels by means of numerical simulations. It is shown that in AWGN channel, soft-input decoding improves slightly the block error rate (BLER) performance when compared to hard decoding; no significant improvement is obtained for Rayleigh channels. We observe that CGA decoding looses its advantage over GMD when applied to concatenated codes. We conclude the work analyzing the reliability of soft-input decoding and measures for its improvement.

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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.870
Threshold uncertainty score0.329

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.000
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.020
GPT teacher head0.255
Teacher spread0.235 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207