Sciweavers

437 search results - page 33 / 88
» Randomized Lattice Decoding
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 1 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 11 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
ICIP
2007
IEEE
16 years 1 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach
ISVLSI
2005
IEEE
108views VLSI» more  ISVLSI 2005»
15 years 5 months ago
Analysis of a Mask-Based Nanowire Decoder
A key challenge facing nanotechnologies will be controlling nanoarrays, two orthogonal sets of nanowires that form a crossbar, using a moderate number of mesoscale wires. Three me...
Eric Rachlin, John E. Savage, Benjamin Gojman
ECCC
2010
73views more  ECCC 2010»
14 years 11 months ago
Matching Vector Codes
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin