On the public citation graph
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
0 signed · 41 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.1109/18.508834openalex-snapshot
On the BCJR trellis for linear block codes
inferredcites →https://doi.org/10.1109/26.705396openalex-snapshot
Near-optimum decoding of product codes: block turbo codes
inferredcites →https://doi.org/10.1109/glocom.2001.965567openalex-snapshot
Progressive edge-growth Tanner graphs
inferredcites →https://doi.org/10.1109/glocom.2004.1378000openalex-snapshot
Maximum likelihood decoding analysis of accumulate-repeat-accumulate 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/icc.2001.936269openalex-snapshot
A heuristic search for good low-density parity-check codes at short block lengths
inferredcites →https://doi.org/10.1109/isit.1998.708742openalex-snapshot
Iterative decoding of generalized low-density parity-check codes
inferredcites →https://doi.org/10.1109/isit.2004.1365542openalex-snapshot
Accumulate repeat accumulate 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/tcomm.2004.826370openalex-snapshot
Design of Low-Density Parity-Check Codes for Modulation and Detection
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1974.1055186openalex-snapshot
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1981.1056404openalex-snapshot
A recursive approach to low complexity 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/access.2021.3065236openalex-snapshot
Parallel Concatenated Block Codes Constructed by Convolutional Interleavers
inferred← citeshttps://doi.org/10.1109/access.2026.3660632openalex-snapshot
Interleaver Design for Parallel Concatenated Block Codes With Arbitrary Lengths
inferred← citeshttps://doi.org/10.1109/atc.2013.6698122openalex-snapshot
A class of doubly-generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/ciss.2012.6310815openalex-snapshot
Performance of efficiently-encodable iteratively-decodable block 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.2006.76openalex-snapshot
CTH08-2: EXIT Chart Analysis for Doubly Generalized LDPC Codes
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/icact.2014.6779150openalex-snapshot
Exact split information function for SPC
inferred← citeshttps://doi.org/10.1109/icc.2013.6655050openalex-snapshot
Design of rate-compatible efficiently-encodable generalized LDPC codes
inferred← citeshttps://doi.org/10.1109/iccs.2012.6406177openalex-snapshot
Serially concatenated codes with euclidean geometry LDPC and convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2006.261869openalex-snapshot
Doubly Generalized LDPC Codes
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/istc.2012.6325220openalex-snapshot
Generalized LDPC code with single-parity-check product constraints at super check nodes
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/lcomm.2022.3168028openalex-snapshot
Modified Convolutional Interleavers for Parallel Concatenated Block Codes
inferred← citeshttps://doi.org/10.1109/surv.2011.040410.00042openalex-snapshot
Low-Density Parity-Check Codes and Their Rateless Relatives
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.2021.3077939openalex-snapshot
Protograph-Based LDPC Hadamard Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2040938openalex-snapshot
Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel
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/twc.2014.2359221openalex-snapshot
Design and Analysis of Root-Protograph LDPC Codes for Non-Ergodic Block-Fading Channels
inferred← citeshttps://doi.org/10.18130/v3pr50openalex-snapshot
Design of Finite-Length Generalized LDPC Codes
inferred← citeshttps://doi.org/10.3390/info17050436openalex-snapshot
Parallel concatenated block codes with flexible lengths and near-optimum performance
inferred← citeshttps://doi.org/10.3390/math12193127openalex-snapshot
A New Class of Braided Block Codes Constructed by Convolutional Interleavers
inferred← citeshttps://doi.org/10.5772/intechopen.88199openalex-snapshot
Generalized Low-Density Parity-Check Codes: Construction and Decoding Algorithms
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.