On the public citation graph

Construction of Protograph LDPC Codes with Linear Minimum Distance

0 signed · 101 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.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.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/18.959255openalex-snapshot
Low-density parity-check codes based on finite geometries: a rediscovery and new results
inferredcites →https://doi.org/10.1109/26.539767openalex-snapshot
Near optimum error correcting coding and decoding: turbo-codes
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.2001.935913openalex-snapshot
Weight Distribution of Iterative Coding Systems: How Deviant can You be?
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.1222727openalex-snapshot
Codes defined on graphs
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.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.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.1145/276698.276756openalex-snapshot
Analysis of low density codes and improved designs using irregular 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.1007/978-3-032-08236-7_12openalex-snapshot
Constructing Long Codes from Short Ones
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.008openalex-snapshot
Computer-Based Design of LDPC Codes
inferred← citeshttps://doi.org/10.1017/9781009335928.010openalex-snapshot
Ensemble Enumerators for Turbo and LDPC Codes
inferred← citeshttps://doi.org/10.1049/el.2019.2417openalex-snapshot
Low‐complexity encoder for LDPC codes in space applications
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/access.2025.3578151openalex-snapshot
Next-Gen Decoding: Non-Binary LDPC Algorithms for Emerging Power Line and Visible Light Communications
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094410openalex-snapshot
A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes
inferred← citeshttps://doi.org/10.1109/ciss.2013.6552308openalex-snapshot
Cooperative communication using protograph-based low-density parity-check 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/ewdts.2018.8524862openalex-snapshot
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications
inferred← citeshttps://doi.org/10.1109/gcwkshps58843.2023.10464817openalex-snapshot
Adaptive Symbol Mapping for QC-LDPC Coded BICM HARQ Systems
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.2008.ecp.221openalex-snapshot
Protograph E²RC Codes
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425755openalex-snapshot
Conflict Resolution by Matrix Reordering for DVB-T2 LDPC Decoders
inferred← citeshttps://doi.org/10.1109/iccchina.2012.6356946openalex-snapshot
Two-step construction method of protograph-based AR4JA codes in deep space communication
inferred← citeshttps://doi.org/10.1109/iccnc.2012.6167470openalex-snapshot
Characterization and error-correcting codes for TLC flash memories
inferred← citeshttps://doi.org/10.1109/icct.2018.8600012openalex-snapshot
An Algebraic Construction of Quasi-Cyclic LDPC Codes Based on the Conjugates of Primitive Elements over Finite Fields
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/icspcc.2017.8242532openalex-snapshot
Finite-length EXIT analyses for protograph LDPC codes over underwater acoustic channels
inferred← citeshttps://doi.org/10.1109/isit.2007.4557106openalex-snapshot
On the Minimum Distance of Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557166openalex-snapshot
Improving the Performance of Protograph LDPC Codes by Using Different Transmission Energies
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.2009.5205687openalex-snapshot
Trapping set analysis of protograph-based LDPC convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205822openalex-snapshot
Lower bounds on the graphical complexity of finite-length LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513587openalex-snapshot
Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC
inferred← citeshttps://doi.org/10.1109/isit.2010.5513595openalex-snapshot
On the thresholds of generalized LDPC convolutional codes based on protographs
inferred← citeshttps://doi.org/10.1109/isit.2010.5513638openalex-snapshot
On distance properties of quasi-cyclic protograph-based LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2012.6284229openalex-snapshot
Spatially coupled ensembles universally achieve capacity under belief propagation
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834415openalex-snapshot
A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel Approximation
inferred← citeshttps://doi.org/10.1109/istc.2010.5613828openalex-snapshot
Optimized variable degree matched mapping for protograph LDPC coded modulation with 16QAM
inferred← citeshttps://doi.org/10.1109/istc.2010.5613891openalex-snapshot
Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit
inferred← citeshttps://doi.org/10.1109/iswcs49558.2021.9562244openalex-snapshot
Low Rate Protograph-Based LDPC Codes for Continuous Variable Quantum Key Distribution
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/ita.2011.5743566openalex-snapshot
AWGN channel analysis of terminated LDPC convolutional codes
inferred← citeshttps://doi.org/10.1109/ita.2013.6502981openalex-snapshot
An efficient exhaustive low-weight codeword search for structured LDPC codes
inferred← citeshttps://doi.org/10.1109/ita.2015.7308964openalex-snapshot
An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation
inferred← citeshttps://doi.org/10.1109/ita.2015.7309001openalex-snapshot
Spatially-coupled low-density parity check codes: Zigzag-window decoding and code-family design considerations
inferred← citeshttps://doi.org/10.1109/jproc.2007.905132openalex-snapshot
The Development of Turbo and LDPC Codes for Deep-Space Applications
inferred← citeshttps://doi.org/10.1109/jsac.2009.090806openalex-snapshot
Capacity-approaching protograph codes
inferred← citeshttps://doi.org/10.1109/jsac.2009.090807openalex-snapshot
Design and analysis of E2RC codes
inferred← citeshttps://doi.org/10.1109/jsac.2015.2504279openalex-snapshot
On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs
inferred← citeshttps://doi.org/10.1109/ncc48643.2020.9056068openalex-snapshot
Performance of Spatially Coupled LDPC Codes over Underwater Acoustic Communication Channel
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.2008.060590openalex-snapshot
Joint source-channel codes based on irregular turbo codes and variable length codes
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2339329openalex-snapshot
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
inferred← citeshttps://doi.org/10.1109/tcomm.2015.2500234openalex-snapshot
Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds
inferred← citeshttps://doi.org/10.1109/tcomm.2017.2783624openalex-snapshot
Design of Binary LDPC Codes With Parallel Vector Message Passing
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2927567openalex-snapshot
On the Design of Multi-Edge Type Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3063348openalex-snapshot
MET-LDPC Code Ensembles of Low Code Rates With Exponentially Few Small Weight Codewords
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3146259openalex-snapshot
Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution
inferred← citeshttps://doi.org/10.1109/tgcn.2021.3063224openalex-snapshot
Protograph LDPC-Coded BICM-ID With Irregular Mapping: An Emerging Transmission Technique for Massive Internet of Things
inferred← citeshttps://doi.org/10.1109/tit.2009.2021305openalex-snapshot
On Universal Properties of Capacity-Approaching LDPC Code Ensembles
inferred← citeshttps://doi.org/10.1109/tit.2010.2095072openalex-snapshot
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
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.2253152openalex-snapshot
Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2280915openalex-snapshot
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
inferred← citeshttps://doi.org/10.1109/tit.2015.2508455openalex-snapshot
New Classes of Partial Geometries and Their Associated LDPC Codes
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/tsp.2019.8769083openalex-snapshot
Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes
inferred← citeshttps://doi.org/10.1109/tvt.2021.3084939openalex-snapshot
Low-Density Parity-Check Coded Direct Sequence Spread Spectrum Receiver Based on Analog Probabilistic Processing
inferred← citeshttps://doi.org/10.1117/12.818223openalex-snapshot
Structured low-density parity-check codes with bandwidth efficient modulation
inferred← citeshttps://doi.org/10.13021/mars/4988openalex-snapshot
Burst Correction Coding From Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1364/ao.54.003666openalex-snapshot
Re-jagged AR4JA LDPC codes and their applications
inferred← citeshttps://doi.org/10.17760/d20005015openalex-snapshot
Efficient low-density parity-check codes for cooperative communication
inferred← citeshttps://doi.org/10.31274/etd-180810-193openalex-snapshot
Network flow algorithms for wireless networks and design and analysis of rate compatible LDPC codes
inferred← citeshttps://doi.org/10.3390/e25081189openalex-snapshot
Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory
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.37591/jotssn.v5i1.897openalex-snapshot
FPGA Implementation of LDPC Codes
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.0903.2315openalex-snapshot
Design and Analysis of E2RC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2386openalex-snapshot
Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2999openalex-snapshot
Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.1701.07521openalex-snapshot
Floor Scale Modulo Lifting for QC-LDPC codes
inferred← citeshttps://doi.org/10.48550/arxiv.2011.14753openalex-snapshot
Topologically Driven Methods for Construction Of Multi-Edge Type (Multigraph with nodes puncturing) Quasi-Cyclic Low-density Parity-check Codes for Wireless Channel, WDM Long-Haul and Archival Holographic Memory
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11787openalex-snapshot
Quasi-strongly regular graphs of grade three with diameter two
inferred← citeshttps://doi.org/10.70675/33b3bb67z32a5z4b97z9aefzfbfa85091ee0openalex-snapshot
Sparse graph-based coding schemes for continuous phase modulations
inferred← citeshttps://doi.org/10.70675/b0347dd5z4147z4be1z9855z248c44529d18openalex-snapshot
Étude de codes LDPC pour applications spatiales optiques et conception des décodeurs associés
inferred← citeshttps://doi.org/10.7463/1014.0727907openalex-snapshot
Error Correcting Coding of Telemetry Information for Channel with Random Bit Inversions and Deletions
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.