On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1) , 162-171
- https://doi.org/10.1109/18.651011
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Trellis complexity and minimal trellis diagrams of latticesIEEE Transactions on Information Theory, 1998
- Dimension/length profiles and trellis complexity of linear block codesIEEE Transactions on Information Theory, 1994
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encodersIEEE Transactions on Information Theory, 1993
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica, 1990
- Dual vectors and lower bounds for the nearest lattice point problemCombinatorica, 1988
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- Algorithms to construct minkowski reduced and hermite reduced lattice basesTheoretical Computer Science, 1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Improved algorithms for integer programming and related lattice problemsPublished by Association for Computing Machinery (ACM) ,1983
- Sur les formes quadratiquesMathematische Annalen, 1873