Factor graphs and the sum-product algorithm
From MaRDI portal
Publication:4544503
DOI10.1109/18.910572zbMATH Open0998.68234DBLPjournals/tit/KschischangFL01OpenAlexW2137813581WikidataQ56698904 ScholiaQ56698904MaRDI QIDQ4544503FDOQ4544503
Frank R. Kschischang, Hans-Andrea Loeliger, Brendan J. Frey
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/08c370eb9ba13bfb836349e7f3ea428be4697818
Viterbi algorithmsum-product algorithmbelief propagationfactor graphsfast Fourier transform algorithmsturbo decoding algorithmforward/backward algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- A library for formalization of linear error-correcting codes
- Robustifying sum-product networks
- An explicit method to generate some QC LDPC codes with girth 8
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Learning representations from dendrograms
- Unsupervised representation learning with minimax distance measures
- Transfer affinity propagation-based clustering
- A review of message passing algorithms in estimation of distribution algorithms
- Title not available (Why is that?)
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
- Convergence and correctness of belief propagation for the Chinese postman problem
- Knowledge graphs completion via probabilistic reasoning
- Graphs for margins of Bayesian networks
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- Bit-optimal decoding of codes whose Tanner graphs are trees
- Model-based machine learning
- Geometric Constructions of Gallager Codes
- On a hypergraph probabilistic graphical model
- Improving probabilistic inference in graphical models with determinism and cycles
- A local algorithm and its percolation analysis of bipartite z-matching problem
- On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
- On the survey-propagation equations in random constraint satisfiability problems
- Relaxed maximum a posteriori fault identification
- Title not available (Why is that?)
- Operator growth bounds from graph theory
- On the convergence of kikuchi's natural iteration method
- A generalized gamma mixture model for ultrasonic tissue characterization
- Cortical Circuitry Implementing Graphical Models
- Ensemble clustering using factor graph
- Parallel probabilistic graphical model approach for nonparametric Bayesian inference
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- \textsc{Friet}: an authenticated encryption scheme with built-in fault detection
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- Statistical mechanics of the fashion game on random networks
- Bayesian Inference in Cumulative Distribution Fields
- Graph-based slice-to-volume deformable registration
- Monotonic optimization based decoding for linear codes
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- On the Uniqueness of Loopy Belief Propagation Fixed Points
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Distribution of statistics of hidden state sequences through the sum-product algorithm
- A novel probabilistic clustering model for heterogeneous networks
- Convergence of a belief propagation algorithm for biological networks
- A biclustering approach based on factor graphs and the max-sum algorithm
- Study of the variable growth hypernetworks influence on the scaling law
- Characterizations of pseudo-codewords of (low-density) parity-check codes
- Joint source-decoding in large scale sensor networks using Markov random field models
- On learning conditional random fields for stereo
- Tomographic reconstruction from a small number of projections by an efficient sum-product reasoning method
- Random subcubes as a toy model for constraint satisfaction problems
- Graphical models for statistical inference and data assimilation
- Convex combination belief propagation
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Factor metanetwork: a multilevel probabilistic meta-model based on factor graphs
- An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- ON THE CLASS OF ARRAY-BASED APM-LDPC CODES
- Title not available (Why is that?)
- Basics of Secrecy Coding
- Title not available (Why is that?)
- Transducing Markov sequences
- Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation
- Belief propagation: accurate marginals or accurate partition function—where is the difference?
- Random Instances of Problems in NP – Algorithms and Statistical Physics
- Learning multi-agent coordination through connectivity-driven communication
- Statistical and Computational Guarantees for the Baum-Welch Algorithm
- Lifting factor graphs with some unknown factors
- The theoretical capacity of the Parity Source Coder
- Lowering the error floor of Gallager codes: a statistical-mechanical view
- Statistical mechanics of reputation systems in autonomous networks
- The large deviations of the whitening process in random constraint satisfaction problems
- Generalizedk-core pruning process on directed networks
- Two faces of greedy leaf removal procedure on graphs
- Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
- Propagation of external regulation and asynchronous dynamics in random Boolean networks
- Valued constraint satisfaction problems
- A new approach to constructing CSS codes based on factor graphs
- Title not available (Why is that?)
- Marginalization in models generated by compositional expressions
- Linear Response Algorithms for Approximate Inference in Graphical Models
- IMPACT OF SUBCARRIER ALLOCATION BY ROWS ON TOTAL SUM RATE FOR SCMA SYSTEMS
- SPARSE CODE MULTIPLE ACCESS CODEBOOK DESIGN USING SINGULAR VALUE DECOMPOSITION
- Multi-view clustering by virtually passing mutually supervised smooth messages
- Link-Level Aspects
- An evolutionary model that satisfies detailed balance
- Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion
- Characterizing Marginalization and Incremental Operations on the Bayes Tree
- Title not available (Why is that?)
- A New Inference Framework for Dependency Networks
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
- Phase transitions in theq-coloring of random hypergraphs
- Robust control for underwater cooperative localization systems with unknown noise and multiple nodes
- Geometrical organization of solutions to random linear Boolean equations
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
- High-Dimensional Macroeconomic Forecasting Using Message Passing Algorithms
- Measure Transformer Semantics for Bayesian Machine Learning
This page was built for publication: Factor graphs and the sum-product algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544503)
