Sciweavers

7758 search results - page 6 / 1552
» On the Number of Distributive Lattices
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 8 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan
ASIACRYPT
2004
Springer
14 years 2 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
JCSS
2007
88views more  JCSS 2007»
13 years 8 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles
JCAM
2011
78views more  JCAM 2011»
12 years 11 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
CIE
2005
Springer
14 years 2 months ago
Kripke Models, Distributive Lattices, and Medvedev Degrees
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while...
Sebastiaan Terwijn