Codes on graphs: normal realizations

DOI10.1109/18.910573MaRDI QIDQ4544504zbMATHOpenAlexFDO

Authors G. David jun. Forney

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/19015d8c7b982f8d49745ffd2fe34842e6f4a831

zbMATH Keywords

graphical modellinear codesdual graphsum-product algorithmdecodingdual group codelinear state realizations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Codes on Graphs: Fundamentals
• On graphs and codes
• Codes on graphs: Recent progress
• Publication:4502606
• Codes over graphs
• Codes on graphs: constraint complexity of cycle-free realizations of linear codes
• scientific article; zbMATH DE number 4070305
• On the Grassmann graph of linear codes
• Some results on the norm of codes
• Publication:4207865

Cited in

(26)

• A complete dichotomy rises from the capture of vanishing signatures
• Codes on graphs: constraint complexity of cycle-free realizations of linear codes
• A new approach to constructing CSS codes based on factor graphs
• Gauges, loops, and polynomials for partition functions of graphical models
• Bayesian filtering with multiple internal models: toward a theory of social intelligence
• Belief propagation and loop series on planar graphs
• On Factor Graphs and the Fourier Transform
• Codes on graphs: Recent progress
• Identifying an unknown code by partial Gaussian elimination
• Branching time active inference: the theory and its generality
• Basics of secrecy coding
• Spike-based probabilistic inference in analog graphical models using interspike-interval coding
• Bucket renormalization for approximate inference
• Gauging variational inference
• Matrix fraction descriptions in convolutional coding
• Message-passing algorithms for inference and optimization
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
• Characterizations of pseudo-codewords of (low-density) parity-check codes
• Recursive descriptions of polar codes
• scientific article; zbMATH DE number 2063213 (Why is no real title available?)
• Loop series for discrete statistical models on graphs
• Optimized realization of Bayesian networks in reduced normal form using latent variable model
• Reverse-engineering neural networks to characterize their cost functions
• Some results on the norm of codes
• scientific article; zbMATH DE number 1504646 (Why is no real title available?)
• Probabilistic programming with stochastic variational message passing

This page was built for publication: Codes on graphs: normal realizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544504)