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 ...
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 ...
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 ...
—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...
—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...