Oded Regev. Improved Inapproximability of Lattice and Coding Problems with Preprocessing. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 363-370, IEEE Computer Society, 2003. [doi]
Abstract is missing.