Hardness of Approximating the Minimum Distance of a Linear Code

@inproceedings{Dumer1999HardnessOA,
  title={Hardness of Approximating the Minimum Distance of a Linear Code},
  author={Ilya Dumer and Daniele Micciancio and Madhu Sudan},
  booktitle={FOCS},
  year={1999}
}
Highly Cited
This paper has 177 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 100 extracted citations

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

IEEE Transactions on Information Theory • 2014
View 6 Excerpts
Highly Influenced

Improved inapproximability of lattice and coding problems with preprocessing

IEEE Transactions on Information Theory • 2003
View 5 Excerpts
Highly Influenced

Two Theorems in List Decoding

Electronic Colloquium on Computational Complexity • 2010
View 3 Excerpts
Highly Influenced

Two Theorems in List Decoding ∗ Atri

Rudra Steve Uurtamo
2010
View 3 Excerpts
Highly Influenced

Hard Problems of Algebraic Geometry Codes

IEEE Transactions on Information Theory • 2008
View 3 Excerpts
Highly Influenced

Classification of linear codes exploiting an invariant

Contributions to Discrete Mathematics • 2006
View 6 Excerpts
Highly Influenced

Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique

45th Annual IEEE Symposium on Foundations of Computer Science • 2004
View 6 Excerpts
Highly Influenced

177 Citations

01020'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…