On the public citation graph
Ensemble Enumerators for Protograph-Based Generalized LDPC Codes
0 signed · 35 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/11617983_24openalex-snapshot
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
inferredcites →https://doi.org/10.1109/18.669119openalex-snapshot
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
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/glocom.2005.1577850openalex-snapshot
Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels
inferredcites →https://doi.org/10.1109/isit.2002.1023275openalex-snapshot
Finite-length analysis of LDPC codes with large left degrees
inferredcites →https://doi.org/10.1109/isit.2004.1365243openalex-snapshot
Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles
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.262129openalex-snapshot
Ensemble Weight Enumerators for Protograph LDPC Codes
inferredcites →https://doi.org/10.1109/ita.2007.4357601openalex-snapshot
Ensemble Weight Enumerators for Protograph-Based Generalized LDPC Codes
inferredcites →https://doi.org/10.1109/milcom.2005.1605687openalex-snapshot
Short Low-Error-Floor Tanner Codes with Hamming Nodes
inferredcites →https://doi.org/10.1109/milcom.2006.302313openalex-snapshot
Protograph LDPC Codes over Burst Erasure Channels
inferredcites →https://doi.org/10.1109/tcomm.2007.910585openalex-snapshot
Quasi-Cyclic Generalized LDPC Codes With Low Error Floors
inferredcites →https://doi.org/10.1109/tcomm.2008.050600openalex-snapshot
Quasi-cyclic generalized ldpc codes with low error floors
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.1109/tit.2002.1003839openalex-snapshot
Finite-length analysis of low-density parity-check codes on the binary erasure channel
inferredcites →https://doi.org/10.1109/tit.2003.820012openalex-snapshot
Distance distributions in ensembles of irregular low-density parity-check codes
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.842571openalex-snapshot
Stopping Set Distribution of LDPC Code Ensembles
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.1017/9781009335928.010openalex-snapshot
Ensemble Enumerators for Turbo and LDPC Codes
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/glocom.2009.5425250openalex-snapshot
Ensemble Pseudocodeword Weight Enumerators for Protograph-Based Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/glocom.2009.5426116openalex-snapshot
Growth Rate of the Weight Distribution of Doubly-Generalized LDPC Codes: General Case and Efficient Evaluation
inferred← citeshttps://doi.org/10.1109/glocom.2010.5684185openalex-snapshot
On Design of Doubly-Generalized LDPC Codes Based on Multi-Type Information Functions
inferred← citeshttps://doi.org/10.1109/icc.2010.5502377openalex-snapshot
Spectral Shape of Check-Hybrid GLDPC Codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205688openalex-snapshot
Exact erasure channel density evolution for protograph-based generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513600openalex-snapshot
On the typical minimum distance of protograph-based generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/ita.2008.4601024openalex-snapshot
Asymptotic ensemble enumerators for protograph-based generalized LDPC codes: Computational complexity
inferred← citeshttps://doi.org/10.1109/jsac.2009.090806openalex-snapshot
Capacity-approaching protograph codes
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2896584openalex-snapshot
Spatially Coupled Turbo-Like Codes: A New Trade-Off Between Waterfall and Error Floor
inferred← citeshttps://doi.org/10.4108/chinacom.2010.81openalex-snapshot
From product codes to structured generalized LDPC codes
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02355openalex-snapshot
Finite Length Weight Enumerator Analysis of Braided Convolutional Codes
inferred← citeshttps://doi.org/10.5281/zenodo.22878openalex-snapshot
Improvement Of The Walking Robot Dynamic Stability Using The Dsmt And The Neutrosophic Logic
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.