An analysis of Seysen's lattice reduction algorithm
暂无分享,去创建一个
[1] E. Kaltofen,et al. Computing the sign or the value of the determinant of an integer matrix, a complexity survey , 2004 .
[2] Robert F. H. Fischer,et al. Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).
[3] Brian A. LaMacchia. Basis Reduction Algorithms and Subset Sum Problems , 1991 .
[4] A. Korkine,et al. Sur les formes quadratiques , 1873 .
[5] Philippe Flajolet,et al. An analysis of the Gaussian algorithm for lattice reduction , 1994, ANTS.
[6] K. Scharnhorst,et al. Angles in Complex Vector Spaces , 1999 .
[7] M. Seysen,et al. Simultaneous reduction of a lattice basis and its reciprocal basis , 1993, Comb..
[8] Ron Steinfeld,et al. Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes , 2007, IEEE Trans. Inf. Theory.
[9] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[10] Dirk Wübben,et al. Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[11] Gregory W. Wornell,et al. Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.