On the public citation graph

Ensemble Weight Enumerators for Protograph LDPC Codes

0 signed · 80 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.485713openalex-snapshot
Unveiling turbo codes: some results on parallel concatenated coding schemes
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.1577834openalex-snapshot
Protograph based LDPC codes with minimum distance linearly growing with block size
inferredcites →https://doi.org/10.1109/isit.1995.531134openalex-snapshot
Unveiling turbo codes: some results on parallel concatenated codes
inferredcites →https://doi.org/10.1109/isit.2001.935913openalex-snapshot
Weight Distribution of Iterative Coding Systems: How Deviant can You be?
inferredcites →https://doi.org/10.1109/isit.2004.1365045openalex-snapshot
The average weight distribution of tanner code ensembles and a way to modify them to improve their weight distribution
inferredcites →https://doi.org/10.1109/isit.2004.1365139openalex-snapshot
Weight distributions of LDPC code ensembles: combinatorics meets statistical physics
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.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/mcom.2003.1222728openalex-snapshot
The renaissance of gallager's low-density parity-check codes
inferredcites →https://doi.org/10.1109/tcomm.2003.820746openalex-snapshot
Upper bounds to error probabilities of coded systems beyond the cutoff rate
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.2002.805065openalex-snapshot
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders
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.1002/9781119471509.w5gref013openalex-snapshot
Low‐Density Parity‐Check ( LDPC ) Codes for 5G Communications
inferred← citeshttps://doi.org/10.1007/978-81-322-2135-7_39openalex-snapshot
Protograph-Based Design of Non-Binary LDPC Codes
inferred← citeshttps://doi.org/10.1016/b978-0-12-396499-1.00003-0openalex-snapshot
Low-Density Parity-Check Code Constructions
inferred← citeshttps://doi.org/10.1017/9781009335928.010openalex-snapshot
Ensemble Enumerators for Turbo and LDPC Codes
inferred← citeshttps://doi.org/10.1109/access.2018.2873058openalex-snapshot
Optimized Construction of Protograph G-LDPC Codes by Modified EXIT Chart and MACE for New-Generation Wireless Communications
inferred← citeshttps://doi.org/10.1109/access.2020.3030647openalex-snapshot
3D EXIT Charts for Analyzing the 5G 3GPP New Radio LDPC Decoder
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797678openalex-snapshot
Asymptotic distance and convergence analysis of braided protograph convolutional codes
inferred← citeshttps://doi.org/10.1109/ewdts.2017.8110069openalex-snapshot
Generalization of floor lifting for QC-LDPC codes
inferred← citeshttps://doi.org/10.1109/ewdts.2018.8524862openalex-snapshot
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications
inferred← citeshttps://doi.org/10.1109/glocom.2006.78openalex-snapshot
CTH08-4: Protograph LDPC Codes with Node Degrees at Least 3
inferred← citeshttps://doi.org/10.1109/glocom.2007.287openalex-snapshot
Ensemble Enumerators for Protograph-Based Generalized LDPC Codes
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.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/icc.2012.6364482openalex-snapshot
Connecting spatially coupled LDPC code chains
inferred← citeshttps://doi.org/10.1109/iccc52777.2021.9580405openalex-snapshot
Design of Protograph-based LDPC Codes for DVB-S2 Systems
inferred← citeshttps://doi.org/10.1109/isit.2007.4557558openalex-snapshot
On the Exhaustion and Elimination of Trapping Sets: Algorithms & The Suppressing Effect
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/isit.2008.4595143openalex-snapshot
Asymptotically good LDPC convolutional codes based on protographs
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.5205687openalex-snapshot
Trapping set analysis of protograph-based LDPC convolutional 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/isit.2011.6033700openalex-snapshot
Exact free distance and trapping set growth rates for LDPC convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2012.6284232openalex-snapshot
Improving spatially coupled LDPC codes by connecting chains
inferred← citeshttps://doi.org/10.1109/isit.2014.6875412openalex-snapshot
Distance enumerator analysis for multi-user codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282985openalex-snapshot
Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration
inferred← citeshttps://doi.org/10.1109/ita.2007.4357601openalex-snapshot
Ensemble Weight Enumerators for 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/ita.2009.5044956openalex-snapshot
Asymptotic trapping set analysis of regular protograph-based LDPC convolutional code ensembles
inferred← citeshttps://doi.org/10.1109/ita.2010.5454136openalex-snapshot
On the existence of typical minimum distance for protograph-based 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/ita.2011.5743566openalex-snapshot
AWGN channel analysis of terminated LDPC convolutional codes
inferred← citeshttps://doi.org/10.1109/ita.2012.6181771openalex-snapshot
New codes on graphs constructed by connecting spatially coupled chains
inferred← citeshttps://doi.org/10.1109/ita.2012.6181802openalex-snapshot
On the typical minimum distance of protograph-based non-binary LDPC codes
inferred← citeshttps://doi.org/10.1109/jsac.2009.090806openalex-snapshot
Capacity-approaching protograph codes
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.2006.302313openalex-snapshot
Protograph LDPC Codes over Burst Erasure Channels
inferred← citeshttps://doi.org/10.1109/milcom.2007.4454752openalex-snapshot
Short Protograph-Based LDPC Codes
inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3390000openalex-snapshot
Channel Coding Toward 6G: Technical Overview and Outlook
inferred← citeshttps://doi.org/10.1109/tcomm.2007.894109openalex-snapshot
Accumulate-Repeat-Accumulate Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.06.070652openalex-snapshot
Minimum distance lower bounds for girth-constrained RA code ensembles
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2957474openalex-snapshot
Variable-Weight Block Dual-Diagonal Structure for Low-Rate QC LDPC Codes With Low Error Floors
inferred← citeshttps://doi.org/10.1109/tit.2009.2015993openalex-snapshot
Finding All Small Error-Prone Substructures in LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2094819openalex-snapshot
Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2211995openalex-snapshot
Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2262494openalex-snapshot
Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation
inferred← citeshttps://doi.org/10.1109/tit.2016.2569528openalex-snapshot
Distance Enumerator Analysis for Interleave-Division Multi-User Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2647724openalex-snapshot
Weight Distributions of Non-Binary Multi-Edge Type LDPC Code Ensembles: Analysis and Efficient Evaluation
inferred← citeshttps://doi.org/10.1109/tsp.2018.8441303openalex-snapshot
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes
inferred← citeshttps://doi.org/10.1109/turbocoding.2008.4658734openalex-snapshot
Free distance bounds for protograph-based regular LDPC convolutional codes
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.1561/0100000009openalex-snapshot
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
inferred← citeshttps://doi.org/10.17760/d20005015openalex-snapshot
Efficient low-density parity-check codes for cooperative communication
inferred← citeshttps://doi.org/10.3390/e18080305openalex-snapshot
An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes †
inferred← citeshttps://doi.org/10.3390/e28060604openalex-snapshot
Construction of Efficient High-Rate Protograph QC-LDPC Codes by Joint EXIT Chart, PEG, AWD, and QC-NLACE Techniques
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.135-136.167openalex-snapshot
Accumulate-Repeat-Delay-Partial-Delay Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5668openalex-snapshot
Connecting Spatially Coupled LDPC Code Chains
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609046openalex-snapshot
Exhausting Error-Prone Patterns in LDPC Codes
inferred← citeshttps://doi.org/10.70675/33b3bb67z32a5z4b97z9aefzfbfa85091ee0openalex-snapshot
Sparse graph-based coding schemes for continuous phase modulations
inferred← citeshttps://doi.org/10.7907/86by-ma30.openalex-snapshot
Asymptotic Weight Analysis of Low-Density Parity Check (LDPC) Code Ensembles
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.