On the public citation graph
Sharp Bounds for MAP Decoding of General Irregular LDPC Codes
0 signed · 20 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s100510170089openalex-snapshot
The glassy phase of Gallager codes
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.1109/18.910579openalex-snapshot
Efficient encoding of low-density parity-check codes
inferredcites →https://doi.org/10.1109/itw.2006.1633836openalex-snapshot
On the relation between MAP and BP GEXIT functions of low density parity check codes
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.1289openalex-snapshot
Estimating random variables from random sparse observations
inferred← citeshttps://doi.org/10.1007/s10955-009-9781-6openalex-snapshot
Exact Solution of the Gauge Symmetric p-Spin Glass Model on a Complete Graph
inferred← citeshttps://doi.org/10.1109/isit.2007.4557357openalex-snapshot
Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel
inferred← citeshttps://doi.org/10.1109/isit.2009.5205919openalex-snapshot
Decay of correlations in low density parity check codes: Low noise regime
inferred← citeshttps://doi.org/10.1109/itw.2008.4578698openalex-snapshot
Proof of replica formulas in the high noise regime for communication using LDGM codes
inferred← citeshttps://doi.org/10.1109/tit.2007.899536openalex-snapshot
Sharp Bounds on Generalized EXIT Functions
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.2010.2070131openalex-snapshot
Tight Bounds on the Capacity of Binary Input Random CDMA Systems
inferred← citeshttps://doi.org/10.1109/turbocoding.2008.4658665openalex-snapshot
Decay of correlations: An application to low-density parity check codes
inferred← citeshttps://doi.org/10.1137/090751827openalex-snapshot
Decay of Correlations for Sparse Graph Error Correcting Codes
inferred← citeshttps://doi.org/10.1145/1806689.1806706openalex-snapshot
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4461openalex-snapshot
Polar codes for channel and source coding
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.