MétaCan
Menu
Back to cohort
Record W2152004013 · doi:10.1109/spawc.2005.1506272

The factor graph EM algorithm: applications for LDPC codes

2005· article· en· W2152004013 on OpenAlexaff
Andrew W. Eckford

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFactor graphLow-density parity-check codeComputer scienceAlgorithmDecoding methodsFadingBlock codeMessage passingTanner graphFactor (programming language)Error floorCoding (social sciences)Channel codeTheoretical computer scienceMathematicsParallel computing

Abstract

fetched live from OpenAlex

The factor graph EM (FGEM) algorithm is introduced, which is a way of describing the EM algorithm as a message-passing algorithm over a factor graph. Some interesting properties of this algorithm are discussed, such as its ability to break certain cycles in factor graphs. Systems with LDPC codes are used as a starting point for practical applications of the FGEM algorithm. In particular, in channels with an unknown channel state, FGEM-based estimation-decoding algorithms can be straightforwardly obtained, and specific examples are given using the block fading channel. Applications for LDPC-based source coding, especially the Slepian-Wolf coding problem, are also given.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.002

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.019
GPT teacher head0.291
Teacher spread0.272 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations9
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicError Correcting Code TechniquesFrench-language works237,207