On the public citation graph

Decay of Correlations for Sparse Graph Error Correcting Codes

0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01010473openalex-snapshot
Some properties of random Ising models
inferredcites →https://doi.org/10.1007/bf02099437openalex-snapshot
Taming Griffiths' singularities: Infinite differentiability of quenched correlation functions
inferredcites →https://doi.org/10.1017/cbo9780511791338openalex-snapshot
Modern Coding Theory
inferredcites →https://doi.org/10.1023/a:1004666811087openalex-snapshot
Statistical Mechanics Approach to Coding Theory
inferredcites →https://doi.org/10.1023/a:1022885828956openalex-snapshot
Replica Bounds for Optimization Problems and Diluted Spin Systems
inferredcites →https://doi.org/10.1063/1.1483378openalex-snapshot
Quadratic replica coupling in the Sherrington–Kirkpatrick mean field spin glass model
inferredcites →https://doi.org/10.1088/1742-5468/2006/06/p06009openalex-snapshot
Loop series for discrete statistical models on graphs
inferredcites →https://doi.org/10.1103/physreve.62.1577openalex-snapshot
Statistical physics of regular low-density parity-check error-correcting codes
inferredcites →https://doi.org/10.1109/18.910573openalex-snapshot
Codes on graphs: normal realizations
inferredcites →https://doi.org/10.1109/18.910579openalex-snapshot
Efficient encoding of low-density parity-check codes
inferredcites →https://doi.org/10.1109/isit.2006.261969openalex-snapshot
Sharp Bounds for MAP Decoding of General Irregular LDPC Codes
inferredcites →https://doi.org/10.1109/isit.2007.4557357openalex-snapshot
Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel
inferredcites →https://doi.org/10.1109/isit.2007.4557441openalex-snapshot
Asymptotic Rate versus Design Rate
inferredcites →https://doi.org/10.1109/isit.2008.4594993openalex-snapshot
Exchange of limits: Why iterative decoding works
inferredcites →https://doi.org/10.1109/isit.2009.5205919openalex-snapshot
Decay of correlations in low density parity check codes: Low noise regime
inferredcites →https://doi.org/10.1109/itw.2008.4578698openalex-snapshot
Proof of replica formulas in the high noise regime for communication using LDGM codes
inferredcites →https://doi.org/10.1109/tit.2004.836693openalex-snapshot
Extrinsic information transfer functions: model and erasure channel properties
inferredcites →https://doi.org/10.1109/tit.2005.853320openalex-snapshot
Tight Bounds for LDPC and LDGM Codes Under MAP Decoding
inferredcites →https://doi.org/10.1109/tit.2006.889002openalex-snapshot
Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes
inferredcites →https://doi.org/10.1109/tit.2007.899536openalex-snapshot
Sharp Bounds on Generalized EXIT Functions
inferredcites →https://doi.org/10.1109/tit.2008.2006466openalex-snapshot
Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding
inferredcites →https://doi.org/10.1109/tit.2009.2030457openalex-snapshot
The Generalized Area Theorem and Some of its Consequences
inferredcites →https://doi.org/10.1109/turbocoding.2008.4658665openalex-snapshot
Decay of correlations: An application to low-density parity check codes
inferredcites →https://doi.org/10.1515/9783110250329openalex-snapshot
Gibbs Measures and Phase Transitions
inferredcites →https://doi.org/10.48550/arxiv.cs/0506083openalex-snapshot
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/allerton.2015.7446993openalex-snapshot
Concentration to zero bit-error probability for regular LDPC codes on the binary symmetric channel: Proof by loop calculus
inferred← citeshttps://doi.org/10.1109/isit.2012.6283929openalex-snapshot
Beyond the Bethe free energy of LDPC codes via polymer expansions
inferred← citeshttps://doi.org/10.1109/tit.2009.2027523openalex-snapshot
Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2422816openalex-snapshot
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2539144openalex-snapshot
Spatial Coupling as a Proof Technique and Three Applications
inferred← citeshttps://doi.org/10.1109/tit.2016.2555843openalex-snapshot
The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion
inferred← citeshttps://doi.org/10.1137/1.9781611973105.95openalex-snapshot
Frozen variables in random boolean constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2213977.2214060openalex-snapshot
The freezing threshold for k-colourings of a random graph
inferred← citeshttps://doi.org/10.3929/ethz-a-007052718openalex-snapshot
Polymer Expansions for Cycle LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1202.2774openalex-snapshot
Beyond the Bethe Free Energy of LDPC Codes via Polymer Expansions
inferred← citeshttps://doi.org/10.48550/arxiv.1303.2168openalex-snapshot
New Understanding of the Bethe Approximation and the Replica Method
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6088openalex-snapshot
The Cavity Method in Coding Theory
inferred← citeshttps://doi.org/10.5555/2627817.2627912openalex-snapshot
Frozen variables in random boolean constraint satisfaction problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.