On the public citation graph

On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

0 signed · 36 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.1017/cbo9780511791338openalex-snapshot
Modern Coding Theory
inferredcites →https://doi.org/10.1109/eeei.2006.321095openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
inferredcites →https://doi.org/10.1109/eeei.2006.321097openalex-snapshot
Log-Domain Calculation of the 1959 Sphere-Packing Bound with Application to M-ary PSK Block Coded Modulation
inferredcites →https://doi.org/10.1109/isit.2004.1365263openalex-snapshot
Reliable channel regions for good codes transmitted over parallel channels
inferredcites →https://doi.org/10.1109/itw.2004.1405302openalex-snapshot
Results on punctured LDPC 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.2003.815777openalex-snapshot
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.2004.824918openalex-snapshot
On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
inferredcites →https://doi.org/10.1109/tit.2004.836667openalex-snapshot
Rate-Compatible Puncturing of Low-Density Parity-Check Codes
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.850230openalex-snapshot
Nonuniform Error Correction Using Low-Density Parity-Check Codes
inferredcites →https://doi.org/10.1109/tit.2006.871615openalex-snapshot
Reliable channel regions for good binary codes transmitted over parallel channels
inferredcites →https://doi.org/10.1109/tit.2006.889606openalex-snapshot
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
inferredcites →https://doi.org/10.1109/tit.2008.928274openalex-snapshot
Capacity Achieving LDPC Codes Through Puncturing
inferredcites →https://doi.org/10.1109/wirles.2005.1549648openalex-snapshot
Capacity achieving LDPC codes through puncturing
inferredcites →https://doi.org/10.48550/arxiv.cs/0506083openalex-snapshot
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/acssc.2009.5469820openalex-snapshot
Adaptive coding and modulation for hybrid FSO/RF systems
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394793openalex-snapshot
On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels
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/glocomw.2010.5700084openalex-snapshot
Link adaptation for parallel channels with encoder rate and modem symbol rate constraints
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619239openalex-snapshot
Weighted-Hamming Metric for Parallel Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2010.01.060685openalex-snapshot
LDPC code design considerations for non-uniform channels
inferred← citeshttps://doi.org/10.1109/tcomm.2011.060911.100409openalex-snapshot
Successive Maximization for Systematic Design of Universally Capacity Approaching Rate-Compatible Sequences of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2012.061412.100460openalex-snapshot
Link Adaptation for Throughput Optimization of Parallel Channels with Application to Hybrid FSO/RF Systems
inferred← citeshttps://doi.org/10.1109/tit.2006.889606openalex-snapshot
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
inferred← citeshttps://doi.org/10.1109/tit.2007.899543openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.924654openalex-snapshot
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]
inferred← citeshttps://doi.org/10.1109/tit.2008.928274openalex-snapshot
Capacity Achieving LDPC Codes Through Puncturing
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.2011.2158489openalex-snapshot
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1561/0100000009openalex-snapshot
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
inferred← citeshttps://doi.org/10.18130/v3n22nopenalex-snapshot
Hybrid Free Space Optical and RF Wireless Communication
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.