MétaCan
Menu
Back to cohort
Record W2990585754 · doi:10.1109/lcomm.2019.2955450

Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor

2019· article· en· W2990585754 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Communications Letters · 2019
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsLow-density parity-check codeError floorForward error correctionComputer scienceConstraint (computer-aided design)Turbo codeConcatenated error correction codeSerial concatenated convolutional codesDecoding methodsAlgorithmTelecommunicationsMathematicsBlock code

Abstract

fetched live from OpenAlex

In this letter, we design time-invariant spatially coupled low-density parity-check (SC-LDPC) codes with small constraint length and low error floor. For this, we modify the codes in the literature that have (close to) minimal constraint length for a given degree distribution and girth, to improve their error floor. This is performed by eliminating (or minimizing the multiplicity of) some of the dominant trapping sets (TSs) of the codes and/or increasing the minimum distance. To reduce the multiplicity of the TSs effectively and efficiently, we devise a technique based on the parent/child relationship between TSs that aims at successively minimizing the multiplicity of TSs depending on their harmfulness.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.921
Threshold uncertainty score0.788

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.0020.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.027
GPT teacher head0.254
Teacher spread0.226 · 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