On the public citation graph
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
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.
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.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
inferredcites →https://doi.org/10.1007/s00493-003-0019-yopenalex-snapshot
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1109/18.641542openalex-snapshot
The intractability of computing the minimum distance of a code
inferredcites →https://doi.org/10.1109/icc.2003.1203996openalex-snapshot
Construction of irregular LDPC codes with low error floors
inferredcites →https://doi.org/10.1109/icc.2004.1312521openalex-snapshot
Construction of short block length irregular low-density parity-check codes
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/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferredcites →https://doi.org/10.1109/sfcs.1998.743433openalex-snapshot
Approximating-CVP to within almost-polynomial factors is NP-hard
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1981.1056404openalex-snapshot
A recursive approach to low complexity codes
inferredcites →https://doi.org/10.1109/tit.2002.1003839openalex-snapshot
Finite-length analysis of low-density parity-check codes on the binary erasure channel
inferredcites →https://doi.org/10.1109/tit.2002.806118openalex-snapshot
Hardness of approximating the minimum distance of a linear code
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.842571openalex-snapshot
Stopping Set Distribution of LDPC Code Ensembles
inferredcites →https://doi.org/10.1109/tit.2005.864441openalex-snapshot
On the stopping distance and the stopping redundancy of codes
inferredcites →https://doi.org/10.1109/tit.2006.887513openalex-snapshot
Improved Upper Bounds on Stopping Redundancy
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.48550/arxiv.cs/0512101openalex-snapshot
On the Complexity of finding Stopping Distance in Tanner 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/11944836openalex-snapshot
FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th International Conference, Kolkata, India, December 13-15, 2006 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_34openalex-snapshot
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.028openalex-snapshot
On the complexity of and solutions to the minimum stopping and trapping set problems
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653931openalex-snapshot
Linear-Time Computation of Code Distance and Minimum Trapping Sets for LDPC Codes with Bounded Treewidth
inferred← citeshttps://doi.org/10.1109/istc.2010.5613902openalex-snapshot
An efficient algorithm for finding dominant trapping sets of LDPC codes
inferred← citeshttps://doi.org/10.1109/itw.2007.4313082openalex-snapshot
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2025573openalex-snapshot
An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
inferred← citeshttps://doi.org/10.1109/tit.2010.2040941openalex-snapshot
On the Hardness of Approximating Stopping and Trapping Sets
inferred← citeshttps://doi.org/10.1109/tit.2011.2171531openalex-snapshot
Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
inferred← citeshttps://doi.org/10.1109/tit.2012.2205663openalex-snapshot
Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
inferred← citeshttps://doi.org/10.22215/etd/2013-09968openalex-snapshot
The Analysis of Error Floor and Graphical Structure of LDPC Codes
inferred← citeshttps://doi.org/10.3969/j.issn.1004-4132.2011.02.001openalex-snapshot
Design of good QC-LDPC codes without small girth in the p-plane
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.