MétaCan
Menu
Back to cohort
Record W3118220768 · doi:10.1109/jlt.2020.3046473

Low-Complexity Rate- and Channel-Configurable Concatenated Codes

2020· article· en· W3118220768 on OpenAlex

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

VenueJournal of Lightwave Technology · 2020
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Toronto
FundersHuawei Technologies
KeywordsConcatenated error correction codeDecoding methodsComputer scienceForward error correctionCoding gainCode rateLow-density parity-check codeError detection and correctionChannel (broadcasting)Serial concatenated convolutional codesBit error rateAlgorithmCoding (social sciences)Computational complexity theoryElectronic engineeringMathematicsTelecommunicationsBlock codeEngineering

Abstract

fetched live from OpenAlex

A low-complexity rate- and channel-configurable forward error-correction (FEC) scheme is proposed, consisting of an inner low-density parity-check code concatenated with an outer zipper code. A tool is developed to optimize a multi-level code architecture so that it can operate at multiple transmission rates, channel qualities, and modulation orders. The optimization criterion is selected to maintain a low estimated data-flow in its decoding operation. A hardware-friendly quasi-cyclic structure is considered for the inner code and the performance and complexity is reported for various designed FEC configurations. Compared to existing FEC schemes, the proposed designs deliver a similar performance with up to 63% reduction in decoding complexity or provide up to 0.6 dB coding gain at a similar decoding complexity.

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

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.0000.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.031
GPT teacher head0.256
Teacher spread0.225 · 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