Sciweavers

274 search results - page 34 / 55
» Counting lattice vectors
Sort
View
ACISP
2004
Springer
15 years 5 months ago
Weak Property of Malleability in NTRUSign
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
SungJun Min, Go Yamamoto, Kwangjo Kim
EJC
2002
14 years 11 months ago
Homology of Newtonian Coalgebras
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
Richard Ehrenborg, Margaret Readdy
TIT
2002
60views more  TIT 2002»
14 years 11 months ago
A Zador-like formula for quantizers based on periodic tilings
We consider Zador's asymptotic formula for the distortion-rate function for a variable-rate vector quantizer in the high-rate case. This formula involves the differential ent...
N. J. A. Sloane, Vinay A. Vaishampayan
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 6 months ago
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehl&...
CSL
2007
Springer
14 years 11 months ago
Soft indexing of speech content for search in spoken documents
The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient ...
Ciprian Chelba, Jorge Silva, Alex Acero