Sciweavers

437 search results - page 55 / 88
» Randomized Lattice Decoding
Sort
View
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 11 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 9 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 11 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 11 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
TIT
2010
112views Education» more  TIT 2010»
14 years 6 months ago
Codes for deletion and insertion channels with segmented errors
Abstract-- We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of b consecutive bits, with at ...
Zhenming Liu, Michael Mitzenmacher