MétaCan
Menu
Back to cohort
Record W2111789128 · doi:10.1109/isit.2002.1023726

Designing irregular LPDC codes using EXIT charts based on message error rate

2003· article· en· W2111789128 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLow-density parity-check codeComputer scienceAdditive white Gaussian noiseAlgorithmTurbo codeDecoding methodsInformation transferGaussianWord error rateRange (aeronautics)Theoretical computer scienceChannel (broadcasting)TelecommunicationsSpeech recognitionEngineering

Abstract

fetched live from OpenAlex

A new analysis of irregular low density parity check (LDPC) codes on AWGN channels based on modified extrinsic information transfer (EXIT) charts is presented. We modify EXIT charts to track the message error rate transfer characteristics of the constituent codes. Previous analyses, which make a Gaussian assumption for all messages passed, are inaccurate at low SNRs. We more accurately track the message error rate transfer by making a Gaussian approximation only for messages sent from variable nodes, with statistics of messages from check nodes computed by simulation. This makes the analysis more accurate, particularly for low rate codes where, at low SNR, the messages from check nodes are far from Gaussian. The new analysis simplifies understanding of the irregular codes to the level of regular case, leading to a simple approach to the design of irregular codes. We have used this method to design irregular LDPC codes that perform close to the Shannon limit over a wider range of rates and variable degrees as compared to previous work. The same method can be used for many other codes defined on graphs.

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.002
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: Methods · Consensus signal: none
Teacher disagreement score0.553
Threshold uncertainty score0.987

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.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.052
GPT teacher head0.292
Teacher spread0.239 · 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

Quick stats

Citations17
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicError Correcting Code TechniquesFrench-language works237,207