616 search results - page 3 / 124 » Decoding One Out of Many |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
ICISC
2008
13 years 7 months ago
2008
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing ...
IUI
2006
ACM
13 years 11 months ago
2006
ACM
Recent interest in the use of software character agents raises the issue of how many agents should be used in online learning. In this paper we review evidence concerning the rela...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
—Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message en...