MétaCan
Menu
Back to cohort
Record W2113217811 · doi:10.1109/lcomm.2005.1576587

Construction of low-density parity-check convolutional codes through progressive edge-growth

2005· article· en· W2113217811 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

VenueIEEE Communications Letters · 2005
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsLow-density parity-check codeComputer scienceSerial concatenated convolutional codesAlgorithmTurbo codeConvolutional codeEnhanced Data Rates for GSM EvolutionParity-check matrixParity bitDecoding methodsTheoretical computer scienceConcatenated error correction codeBlock codeTelecommunications

Abstract

fetched live from OpenAlex

In this letter, we propose a novel approach of constructing low-density parity-check convolutional codes (LDPC-CCs), based on the progressive edge-growth (PEG) algorithm. LDPC-CC related modifications are made upon the original PEG algorithm to generate the time-varying parity-check matrix. The proposed method can generate LDPC-CCs with large girth, and is flexible in handling codes with different parameters. Simulation results show that such codes have good performance.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.650
Threshold uncertainty score0.749

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.001
Scholarly communication0.0000.001
Open science0.0020.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.028
GPT teacher head0.289
Teacher spread0.262 · 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