Sciweavers

27 search results - page 4 / 6
» High-Throughput Random Access via Codes on Graphs
Sort
View
INFOCOM
2011
IEEE
12 years 9 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 6 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
TCOM
2011
118views more  TCOM 2011»
13 years 21 days ago
A Joint Network and Channel Coding Strategy for Wireless Decode-and-Forward Relay Networks
—In this paper, we consider a wireless multicast network with multiple sources, relays, and destinations. We adopt a multi-hop decode-and-forward relay protocol such that two can...
Qiang Li, See Ho Ting, Chin Keong Ho
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 9 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami