Codes on graphs: normal realizations
From MaRDI portal
Publication:4544504
DOI10.1109/18.910573zbMath0998.94021OpenAlexW2139584447MaRDI QIDQ4544504
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
linear codesdecodinggraphical modeldual graphsum-product algorithmdual group codelinear state realizations
Linear codes (general theory) (94B05) Graph theory (including graph drawing) in computer science (68R10) Decoding (94B35)
Related Items
Characterizations of pseudo-codewords of (low-density) parity-check codes ⋮ Matrix fraction descriptions in convolutional coding ⋮ Belief propagation and loop series on planar graphs ⋮ Loop series for discrete statistical models on graphs ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Basics of Secrecy Coding ⋮ Probabilistic programming with stochastic variational message passing ⋮ Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Message-passing algorithms for inference and optimization ⋮ Recursive descriptions of polar codes ⋮ A new approach to constructing CSS codes based on factor graphs ⋮ Codes on graphs: Recent progress ⋮ Bayesian Filtering with Multiple Internal Models: Toward a Theory of Social Intelligence ⋮ A Complete Dichotomy Rises from the Capture of Vanishing Signatures ⋮ Reverse-Engineering Neural Networks to Characterize Their Cost Functions ⋮ Gauging variational inference ⋮ Bucket renormalization for approximate inference ⋮ Gauges, loops, and polynomials for partition functions of graphical models ⋮ Optimized realization of Bayesian networks in reduced normal form using latent variable model
This page was built for publication: Codes on graphs: normal realizations
