On the public citation graph
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
0 signed · 47 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/3-540-46796-3_7openalex-snapshot
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
inferredcites →https://doi.org/10.1109/18.782170openalex-snapshot
Which codes have cycle-free Tanner 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/isit.2001.935864openalex-snapshot
On the complexity of reliable communication on the erasure channel
inferredcites →https://doi.org/10.1109/tcomm.2006.877956openalex-snapshot
EXIT functions for binary input memoryless symmetric channels
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.2002.801408openalex-snapshot
Upper bounds on the rate of LDPC codes
inferredcites →https://doi.org/10.1109/tit.2003.813560openalex-snapshot
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
inferredcites →https://doi.org/10.1109/tit.2004.824917openalex-snapshot
On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
inferredcites →https://doi.org/10.1109/tit.2005.850079openalex-snapshot
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
inferredcites →https://doi.org/10.1109/tit.2005.853320openalex-snapshot
Tight Bounds for LDPC and LDGM Codes Under MAP Decoding
inferredcites →https://doi.org/10.1109/tit.2006.889462openalex-snapshot
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
inferredcites →https://doi.org/10.48550/arxiv.cs/0410028openalex-snapshot
Life Above Threshold: From List Decoding to Area Theorem and MSE
inferredcites →https://doi.org/10.48550/arxiv.cs/0506083openalex-snapshot
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding
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.1063/5.0059329openalex-snapshot
A novel implementation of 4 bit parity generator in 7nm technology
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797677openalex-snapshot
Bounds on the MMSE of “bad” LDPC codes at rates above capacity
inferred← citeshttps://doi.org/10.1109/ciss.2009.5054784openalex-snapshot
Cooperative sensing of primary users in cognitive radio networks based on message passing
inferred← citeshttps://doi.org/10.1109/ciss.2010.5464840openalex-snapshot
Decoding complexity of irregular LDGM-LDPC codes over the BISOM channels
inferred← citeshttps://doi.org/10.1109/isit.2009.5205638openalex-snapshot
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles
inferred← citeshttps://doi.org/10.1109/isit.2009.5205692openalex-snapshot
Capacity-achieving codes for channels with memory with maximum-likelihood decoding
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.2009.5205866openalex-snapshot
Linear programming bounds on the degree distributions of LDPC code ensembles
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/isit.2016.7541828openalex-snapshot
Asymptotic MAP upper bounds for LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437530openalex-snapshot
Deep Learning for Decoding of Linear Codes - A Syndrome-Based Approach
inferred← citeshttps://doi.org/10.1109/istc.2012.6325230openalex-snapshot
Irregular repeat accumulate codes with few iterations for the binary adder channel
inferred← citeshttps://doi.org/10.1109/istc.2016.7593128openalex-snapshot
Analysis of LDPC code syndrome entropy based on subgraphs
inferred← citeshttps://doi.org/10.1109/itw.2009.5351232openalex-snapshot
On upper bounds for the achievable rates of LDPC codes
inferred← citeshttps://doi.org/10.1109/jsac.2009.090815openalex-snapshot
Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2345694openalex-snapshot
Design of Irregular Repeat Accumulate Codes for Finite Decoder Iterations
inferred← citeshttps://doi.org/10.1109/tit.2006.889462openalex-snapshot
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
inferred← citeshttps://doi.org/10.1109/tit.2008.2009815openalex-snapshot
Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information
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.2009.2027523openalex-snapshot
Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2059490openalex-snapshot
Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2158489openalex-snapshot
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1109/tit.2011.2161953openalex-snapshot
On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix 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.2023.3286452openalex-snapshot
Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity
inferred← citeshttps://doi.org/10.1109/tsp.2009.2018617openalex-snapshot
Parameter Selection for Wyner–Ziv Coding of Laplacian Sources with Additive Laplacian or Gaussian Innovation
inferred← citeshttps://doi.org/10.3929/ethz-a-007050352openalex-snapshot
Iteration-constrained design of IRA codes
inferred← citeshttps://doi.org/10.48550/arxiv.1003.2454openalex-snapshot
Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2999openalex-snapshot
Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation
inferred← citeshttps://doi.org/10.7282/t3b27vctopenalex-snapshot
Properties of LDGM-LDPC codes with applications to secrecy coding
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.