Sciweavers

82 search results - page 9 / 17
» Randomized Decoding for Selection-and-Ordering Problems
Sort
View
LATINCRYPT
2010
13 years 6 months ago
A Lattice-Based Threshold Ring Signature Scheme
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 2 months ago
On the Zero-Error Capacity Threshold for Deletion Channels
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, ...
TIT
2010
136views Education» more  TIT 2010»
13 years 2 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
On Maximizing Coverage in Gaussian Relay Networks
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
Vaneet Aggarwal, Amir Bennatan, A. Robert Calderba...
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 7 months ago
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels
— This paper studies a variant of the classical problem of “writing on dirty paper” in which the sum of the input and the interference, or dirt, is multiplied by a random var...
Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Lan...