Sciweavers

13 search results - page 1 / 3
» Inherently nonfinitely based lattices
Sort
View
APAL
2002
83views more  APAL 2002»
13 years 10 months ago
Inherently nonfinitely based lattices
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
Ralph Freese, George F. McNulty, James B. Nation
ICGI
2010
Springer
13 years 8 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
ICIP
2002
IEEE
15 years 14 days ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...
ASIACRYPT
2009
Springer
14 years 5 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
CORR
2007
Springer
101views Education» more  CORR 2007»
13 years 11 months ago
On The Limitations of The Naive Lattice Decoding
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
Mahmoud Taherzadeh, Amir K. Khandani