On the public citation graph

Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes

https://doi.org/10.1007/bf03219809
0 signed · 28 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.1002/ett.4460060507openalex-snapshot
Codes and iterative decoding on general graphs
inferredcites →https://doi.org/10.1007/3-540-60693-9_13openalex-snapshot
Good codes based on very sparse matrices
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1109/18.910575openalex-snapshot
Efficient erasure correcting codes
inferredcites →https://doi.org/10.1109/18.910576openalex-snapshot
Improved low-density parity-check codes using irregular graphs
inferredcites →https://doi.org/10.1109/18.910577openalex-snapshot
The capacity of low-density parity-check codes under message-passing decoding
inferredcites →https://doi.org/10.1109/18.910578openalex-snapshot
Design of capacity-approaching irregular low-density parity-check codes
inferredcites →https://doi.org/10.1109/26.957394openalex-snapshot
Convergence behavior of iteratively decoded parallel concatenated codes
inferredcites →https://doi.org/10.1109/icc.1993.397441openalex-snapshot
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
inferredcites →https://doi.org/10.1109/jsac.2001.924863openalex-snapshot
Guest editorial the turbo principle: from theory to practice
inferredcites →https://doi.org/10.1109/lcomm.2004.827438openalex-snapshot
Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes
inferredcites →https://doi.org/10.1109/sfcs.1994.365734openalex-snapshot
Expander codes
inferredcites →https://doi.org/10.1109/tcomm.2004.838738openalex-snapshot
Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes
inferredcites →https://doi.org/10.1109/tcomm.2006.877971openalex-snapshot
Gear-shift decoding
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1981.1056404openalex-snapshot
A recursive approach to low complexity codes
inferredcites →https://doi.org/10.21236/ad0407946openalex-snapshot
THRESHOLD DECODING
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes

What points at this work

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

inferred← citeshttps://doi.org/10.1109/bsc.2006.1644613openalex-snapshot
On the Robustness of Iterative Decoders
inferred← citeshttps://doi.org/10.1109/isit.2005.1523345openalex-snapshot
Hybrid decoding of irregular LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2006.262017openalex-snapshot
Complexity-Optimized Irregular Decoders
inferred← citeshttps://doi.org/10.1109/lcomm.2004.827438openalex-snapshot
Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2008.080977openalex-snapshot
Robust LDPC decoding using irregular decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2004.838738openalex-snapshot
Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2006.888584openalex-snapshot
Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.01.080069openalex-snapshot
An implementation-friendly binary LDPC decoding algorithm
inferred← citeshttps://doi.org/10.1109/tit.2008.924650openalex-snapshot
Switch-Type Hybrid Hard Decision Decoding Algorithms for Regular Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.22215/etd/2008-06194openalex-snapshot
Performance estimation, code construction and decoding of finite-length low-density parity-check codes
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.