Sciweavers

374 search results - page 15 / 75
» IP = PSPACE using Error Correcting Codes
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
14 years 5 days ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
14 years 3 days ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICASSP
2010
IEEE
13 years 8 months ago
Error resilient video multicast using Randomized Distributed Space Time Codes
—In this paper we study a two-hop cooperative transmission scheme where multiple relays forward the data simultaneously using Randomized Distributed Space Time Codes (R-DSTC). We...
Ozgu Alay, Pei Liu, Yao Wang, Elza Erkip, Shivendr...
TCOM
2011
94views more  TCOM 2011»
13 years 2 months ago
Protection Against Link Errors and Failures Using Network Coding
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
Shizheng Li, Aditya Ramamoorthy