Codes on graphs: normal realizations
DOI10.1109/18.910573zbMATH Open0998.94021OpenAlexW2139584447MaRDI QIDQ4544504FDOQ4544504
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
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
graphical modellinear codesdual graphsum-product algorithmdecodingdual group codelinear state realizations
Graph theory (including graph drawing) in computer science (68R10) Linear codes (general theory) (94B05) Decoding (94B35)
Cited In (26)
- Gauging variational inference
- Optimized realization of Bayesian networks in reduced normal form using latent variable model
- Identifying an unknown code by partial Gaussian elimination
- Codes on graphs: Recent progress
- Branching time active inference: the theory and its generality
- Bucket renormalization for approximate inference
- Belief propagation and loop series on planar graphs
- Loop series for discrete statistical models on graphs
- Codes on graphs: constraint complexity of cycle-free realizations of linear codes
- Gauges, loops, and polynomials for partition functions of graphical models
- Title not available (Why is that?)
- A new approach to constructing CSS codes based on factor graphs
- Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding
- Matrix fraction descriptions in convolutional coding
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- On Factor Graphs and the Fourier Transform
- Some results on the norm of codes
- Probabilistic programming with stochastic variational message passing
- A complete dichotomy rises from the capture of vanishing signatures
- Reverse-Engineering Neural Networks to Characterize Their Cost Functions
- Basics of secrecy coding
- Characterizations of pseudo-codewords of (low-density) parity-check codes
- Message-passing algorithms for inference and optimization
- Recursive descriptions of polar codes
- Bayesian Filtering with Multiple Internal Models: Toward a Theory of Social Intelligence
- Title not available (Why is that?)
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)
