Maximum-likelihood decoding and integer least-squares: The expected complexity
暂无分享,去创建一个
[1] Rohit U. Nabar,et al. Introduction to Space-Time Wireless Communications , 2003 .
[2] Stephen C. Milne,et al. Infinite Families of Exact Sums of Squares Formulas, Jacobi Elliptic Functions, Continued Fractions, and Schur Functions , 2000, math/0008068.
[3] Yuri Gurevich,et al. Average Case Completeness , 1991, J. Comput. Syst. Sci..
[4] Minoru Wakimoto,et al. Integrable Highest Weight Modules over Affine Superalgebras and Appell's Function , 2001 .
[5] Mårten Trolin,et al. The Shortest Vector Problem in Lattices with Many Cycles , 2001, CaLC.
[6] Thomas C. Hales. Sphere packings, I , 1997, Discret. Comput. Geom..
[7] Gerard J. Foschini,et al. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.
[8] Jeffrey C. Lagarias,et al. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..
[9] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .
[10] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[11] Thomas L. Marzetta,et al. Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading , 2000, IEEE Trans. Inf. Theory.
[12] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[13] Claus-Peter Schnorr,et al. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.
[14] Stephen Wolfram,et al. The Mathematica Book , 1996 .
[15] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[16] Babak Hassibi,et al. An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).
[17] G. Hardy,et al. Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work , 1978 .
[18] M. Stephanov,et al. Random Matrices , 2005, hep-ph/0509286.
[19] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[20] Colin Boyd,et al. Cryptography and Coding , 1995, Lecture Notes in Computer Science.
[21] Stephen P. Boyd,et al. Integer parameter estimation in linear models with applications to GPS , 1998, IEEE Trans. Signal Process..
[22] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[23] Amir K. Khandani,et al. On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis , 1998, IEEE Trans. Inf. Theory.
[24] Mohamed Oussama Damen,et al. Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.
[25] Ravi Kannan,et al. Improved algorithms for integer programming and related lattice problems , 1983, STOC.
[26] Oded Goldreich,et al. Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.
[27] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[28] Jean-Pierre Seifert,et al. Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography , 1999, IMACC.
[29] Emanuele Viterbo,et al. A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.
[30] Marvin I. Knopp,et al. Modular Functions In Analytic Number Theory , 1970 .
[31] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[32] Jie Wang,et al. Average-case computational complexity theory , 1998 .
[33] A. Korkine,et al. Sur les formes quadratiques , 1873 .
[34] A. Robert Calderbank,et al. Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.
[35] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.
[36] J. Boutros,et al. Euclidean space lattice decoding for joint detection in CDMA systems , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).
[37] Babak Hassibi,et al. High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.
[38] Gene H. Golub,et al. Matrix computations , 1983 .