Hardness of approximating the minimum distance of a linear code
暂无分享,去创建一个
[1] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..
[2] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[3] Guy Kindler,et al. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[4] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Alexander Vardy,et al. Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.
[6] R. Blahut. Theory and practice of error control codes , 1983 .
[7] Antoine Lobstein. The hardness of solving subset sum with preprocessing , 1990, IEEE Trans. Inf. Theory.
[8] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[9] M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[10] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[11] Carsten Lund,et al. Hardness of approximations , 1996 .
[12] Kurt Mehlhorn,et al. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity , 1990 .
[13] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[14] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[15] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .
[16] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[17] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[18] Jacques Stern,et al. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..
[19] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[20] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[21] Daniele Micciancio. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant , 2000, SIAM J. Comput..
[22] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[23] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[24] Tom Høholdt,et al. Bounds on list decoding of MDS codes , 2001, IEEE Trans. Inf. Theory.
[25] Daniele Micciancio,et al. The shortest vector in a lattice is hard to approximate to within some constant , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[26] Carl A. Gunter,et al. In handbook of theoretical computer science , 1990 .
[27] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[28] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[29] Moni Naor,et al. The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.