Sciweavers

463 search results - page 8 / 93
» The lattice dimension of a graph
Sort
View
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 8 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
SIAMDM
2010
146views more  SIAMDM 2010»
13 years 7 months ago
Bringing Toric Codes to the Next Dimension
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
Ivan Soprunov, Jenya Soprunova
IPPS
2002
IEEE
14 years 1 months ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
14 years 18 days ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 8 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof