Hardness of approximating the minimum distance of a linear code

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 475-484

  Dumer, Ilya ^a   Micciancio, Daniele ^a   Sudan, Madhu ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BINARY CODES; ERROR CORRECTION; POLYNOMIALS; RANDOM PROCESSES;

LINEAR CODE; MINIMUM DISTANCE PROBLEM; RANDOM POLYNOMIAL TIME; RANDOM QUASI POLYNOMIAL TIME;

COMPUTATIONAL COMPLEXITY;

EID: 0032606385     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)