The following pages link to Closest point search in lattices (Q4677541):
Displayed 13 items.
- Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (Q415838) (← links)
- Low-complexity receivers for multiuser detection with an unknown number of active users (Q985473) (← links)
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals (Q1005785) (← links)
- Euclidean distances and least squares problems for a given set of vectors (Q2382757) (← links)
- Efficient algorithms for discrete lattice calculations (Q2390437) (← links)
- A pivoted LLL algorithm (Q2431149) (← links)
- MLAMBDA: a modified LAMBDA method for integer least-squares estimation (Q2434053) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Selected Applications of LLL in Number Theory (Q5188543) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Dense periodic packings of tetrahedra with small repeating units (Q5962349) (← links)