On the public citation graph

CTH08-4: Protograph LDPC Codes with Node Degrees at Least 3

0 signed · 30 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.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/18.959255openalex-snapshot
Low-density parity-check codes based on finite geometries: a rediscovery and new results
inferredcites →https://doi.org/10.1109/18.992777openalex-snapshot
On ensembles of low-density parity-check codes: asymptotic distance distributions
inferredcites →https://doi.org/10.1109/acssc.2004.1399517openalex-snapshot
Multiple rate low-density parity-check codes with constant blocklength
inferredcites →https://doi.org/10.1109/glocom.2001.965567openalex-snapshot
Progressive edge-growth Tanner graphs
inferredcites →https://doi.org/10.1109/glocom.2005.1577834openalex-snapshot
Protograph based LDPC codes with minimum distance linearly growing with block size
inferredcites →https://doi.org/10.1109/isit.2004.1365542openalex-snapshot
Accumulate repeat accumulate codes
inferredcites →https://doi.org/10.1109/isit.2005.1523291openalex-snapshot
Block Error Iterative Decoding Capacity for LDPC Codes
inferredcites →https://doi.org/10.1109/isit.2005.1523728openalex-snapshot
Enumerators for protograph ensembles of LDPC codes
inferredcites →https://doi.org/10.1109/isit.2006.261868openalex-snapshot
Construction of Protograph LDPC Codes with Linear Minimum Distance
inferredcites →https://doi.org/10.1109/isit.2006.262129openalex-snapshot
Ensemble Weight Enumerators for Protograph LDPC Codes
inferredcites →https://doi.org/10.1109/tcomm.2004.833048openalex-snapshot
Selective Avoidance of Cycles in Irregular LDPC Code Construction
inferredcites →https://doi.org/10.1109/tifs.2012.2197614openalex-snapshot
The Scalar Scheme for Reversible Information-Embedding in Gray-Scale Signals: Capacity Evaluation and Code Constructions
inferredcites →https://doi.org/10.1109/tit.2004.828064openalex-snapshot
Asymptotic Enumeration Methods for Analyzing LDPC 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.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/comst.2015.2436705openalex-snapshot
A Survey on Protograph LDPC Codes and Their Applications
inferred← citeshttps://doi.org/10.1109/icosp.2010.5656484openalex-snapshot
Construction of protograph LDPC codes based on Jacket matrices
inferred← citeshttps://doi.org/10.1109/isit.2007.4557666openalex-snapshot
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
inferred← citeshttps://doi.org/10.1109/ita.2008.4601067openalex-snapshot
An improved sphere-packing bound for finite-length codes over symmetric memoryless channels
inferred← citeshttps://doi.org/10.1109/ita.2009.5044941openalex-snapshot
Approaching capacity with asymptotically regular LDPC codes
inferred← citeshttps://doi.org/10.1109/ita.2010.5454141openalex-snapshot
Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity
inferred← citeshttps://doi.org/10.1109/jsac.2009.090806openalex-snapshot
Capacity-approaching protograph codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.04.080558openalex-snapshot
Structure, property, and design of nonbinary regular cycle codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.101210.090757openalex-snapshot
Large-Girth Nonbinary QC-LDPC Codes of Various Lengths
inferred← citeshttps://doi.org/10.1109/tit.2008.920216openalex-snapshot
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
inferred← citeshttps://doi.org/10.1109/wcsp52459.2021.9613319openalex-snapshot
Design of Protograph LDPC Codes for the Unequal Power Two-User Downlink System
inferred← citeshttps://doi.org/10.1155/2014/606913openalex-snapshot
A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1155/2014/895782openalex-snapshot
A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting
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.