On the public citation graph
Doubly Generalized LDPC Codes
0 signed · 63 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.1049/el:19961141openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1049/el:19970362openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1109/18.485714openalex-snapshot
Iterative decoding of binary block and convolutional codes
inferredcites →https://doi.org/10.1109/18.748992openalex-snapshot
Good error-correcting codes based on very sparse matrices
inferredcites →https://doi.org/10.1109/26.957394openalex-snapshot
Convergence behavior of iteratively decoded parallel concatenated codes
inferredcites →https://doi.org/10.1109/4234.781010openalex-snapshot
On generalized low-density parity-check codes based on Hamming component codes
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/icc.1999.767979openalex-snapshot
Generalized low density (Tanner) codes
inferredcites →https://doi.org/10.1109/isit.2003.1228361openalex-snapshot
Design and iterative decoding of networks of many small codes
inferredcites →https://doi.org/10.1109/tcomm.2004.826370openalex-snapshot
Design of Low-Density Parity-Check Codes for Modulation and Detection
inferredcites →https://doi.org/10.1109/tcomm.2006.881270openalex-snapshot
A Hybrid Coding Scheme for the Gilbert–Elliott Channel
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.2004.836693openalex-snapshot
Extrinsic information transfer functions: model and erasure channel properties
inferredcites →https://doi.org/10.1109/tit.2004.839541openalex-snapshot
Regular and irregular progressive edge-growth tanner graphs
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.007openalex-snapshot
Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/access.2022.3204317openalex-snapshot
Construction of Protograph-Based Partially Doped Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797656openalex-snapshot
On the growth rate of the weight distribution of irregular doubly-generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120176openalex-snapshot
Decomposition methods for large scale LP decoding
inferred← citeshttps://doi.org/10.1109/eucnc.2015.7194119openalex-snapshot
Impacts of the packet scheduling on the performance of erasure codes: Methodology and application to GLDPC-Staircase codes
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425440openalex-snapshot
On Asymptotic Ensemble Weight Enumerators of Multi-Edge Type 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.2012.6503433openalex-snapshot
Design of small rate, close to ideal, GLDPC-staircase AL-FEC codes for the erasure channel
inferred← citeshttps://doi.org/10.1109/icc.2010.5502377openalex-snapshot
Spectral Shape of Check-Hybrid GLDPC Codes
inferred← citeshttps://doi.org/10.1109/icct67417.2025.11374279openalex-snapshot
Layered Decoding of DGLDPC Codes Based on a SPC-PC Codes
inferred← citeshttps://doi.org/10.1109/isabel.2009.5373632openalex-snapshot
On the weight and stopping set size distributions of LDPC codes and their generalizations
inferred← citeshttps://doi.org/10.1109/isit.2008.4595171openalex-snapshot
Ensemble weight enumerators for protograph-based doubly generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205696openalex-snapshot
Weight distributions of multi-edge type LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205731openalex-snapshot
On a class of doubly-generalized LDPC codes with single parity-check variable nodes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006552openalex-snapshot
On LDPC code ensembles with generalized constraints
inferred← citeshttps://doi.org/10.1109/isit.2018.8437727openalex-snapshot
EBP-GEXIT Charts Over the Binary-Input AWGN Channel for Generalized and Doubly-Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518035openalex-snapshot
A Class of Non-Binary Doubly-Generalized LDPC codes for Moderate and High Code Rates
inferred← citeshttps://doi.org/10.1109/isita.2008.4895648openalex-snapshot
Code design and performance analysis using a 2-level generalized Tanner graph on the binary erasure channel
inferred← citeshttps://doi.org/10.1109/jsac.2009.090808openalex-snapshot
On asymptotic ensemble weight enumerators of LDPC-like codes
inferred← citeshttps://doi.org/10.1109/milcom.2008.4753226openalex-snapshot
Bounded angle iterative decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00026openalex-snapshot
Turbo-Annihilation of Hook Errors in Stabilizer Measurement Circuits
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606468openalex-snapshot
Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2007.910585openalex-snapshot
Quasi-Cyclic Generalized LDPC Codes With Low Error Floors
inferred← citeshttps://doi.org/10.1109/tcomm.2008.050600openalex-snapshot
Quasi-cyclic generalized ldpc codes with low error floors
inferred← citeshttps://doi.org/10.1109/tcomm.2009.05.070264openalex-snapshot
Doubly Generalized LDPC Codes over the AWGN Channel
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2865469openalex-snapshot
Protograph LDPC Codes With Block Thresholds: Extension to Degree-One and Generalized Nodes
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3167027openalex-snapshot
EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3292474openalex-snapshot
Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.890694openalex-snapshot
Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
inferred← citeshttps://doi.org/10.1109/tit.2008.2011446openalex-snapshot
Doubly-Generalized LDPC Codes: Stability Bound Over the BEC
inferred← citeshttps://doi.org/10.1109/tit.2009.2025573openalex-snapshot
An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
inferred← citeshttps://doi.org/10.1109/tit.2010.2040962openalex-snapshot
On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2094815openalex-snapshot
Divide and Concur and Difference-Map BP Decoders for LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2132650openalex-snapshot
On the Growth Rate of the Weight Distribution of Irregular Doubly Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2281372openalex-snapshot
Decomposition Methods for Large Scale LP Decoding
inferred← citeshttps://doi.org/10.1109/tit.2019.2909917openalex-snapshot
A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC
inferred← citeshttps://doi.org/10.1109/tit.2021.3071743openalex-snapshot
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling
inferred← citeshttps://doi.org/10.1109/vtcspring.2013.6692727openalex-snapshot
Quasi-Cyclic Doubly Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/wcnc.2013.6554790openalex-snapshot
Good coupling between LDPC-staircase and Reed-Solomon for the design of GLDPC codes for the erasure channel
inferred← citeshttps://doi.org/10.1109/wcnc.2015.7127618openalex-snapshot
Doubly-generalized LDPC codes with SPC codes as super variable nodes
inferred← citeshttps://doi.org/10.1109/wcsp.2014.6992199openalex-snapshot
D-GLDPC codes with 3-D single parity-check product codes as super check nodes
inferred← citeshttps://doi.org/10.1186/s13638-016-0660-yopenalex-snapshot
GLDPC-Staircase AL-FEC codes: a fundamental study and new results
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.1611openalex-snapshot
Shifted Coded Slotted ALOHA: A Graph-Based Random Access with Shift Operation
inferred← citeshttps://doi.org/10.23919/isita.2018.8664385openalex-snapshot
Shifted Coded Slotted ALOHA
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1730openalex-snapshot
Divide & Concur and Difference-Map BP Decoders for LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0556openalex-snapshot
Decomposition Methods for Large Scale LP Decoding
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.