Skip to search formSkip to main contentSkip to account menu

Lattice reduction

Known as: Lattice basis reduction, Reduction 
In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The paper discusses a sequence detector based on univariate marginal distribution algorithm (UMDA) that jointly estimates the… 
2010
2010
Based on an improved parameterized integer relation construction method, a complete algorithm is proposed for finding an exact… 
Review
2010
Review
2010
  • F. Eisenbrand
  • 2010
  • Corpus ID: 6266985
This chapter surveys a selection of results from the interplay of integer programming and the geometry of numbers. Apart from… 
2010
2010
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a… 
2008
2008
MIMO transmissions (e.g., V-BLAST) have been widely adopted for high-rate high-performance communication systems. When the… 
2007
2007
Multiple input multiple output-orthogonal frequency division multiplexing-code division multiplexing (MIMO-OFDM-CDM) techniques… 
2005
2005
This report explicitly refutes the analysis behind a recent claim that NTRUEncrypt has a bit security of at most 74 bits. We also… 
2004
2004
A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In… 
2004
2004
Durant ces dernieres annees, un grand interet a ete accorde aux systemes a antennes multiples a cause de leur capacite a… 
1993
1993
Consider the problem of generating bitmaps from character shapes given as outlines. The obvious scan-conversion process does not…