Learn More
We consider zero error function computation in a three node wireless network. Nodes A and B observe X and Y respectively, and want to compute a function f(X, Y ) with zero error. To achieve this, nodes A and B send messages to a relay node C at rates R<sub>A</sub> and R<sub>B</sub> respectively. The relay C then broadcasts a message to A and B at rate(More)
—We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that(More)
—We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources X and Y. The encoder encodes X n and Y n into a message which is given to two decoders. Decoder 1 and decoder 2 have access to X and Y respectively, and they want to compute two functions f (X, Y) and g(X,(More)
We propose an active tomography technique for inferring directed acyclic graph (DAG) logical topologies where intermediate nodes need to perform network coding. Unlike traditional traceroute-based techniques, our technique requires only unidirectional communication on each link, and does not require the nodes to reveal their unique identities. Also, unlike(More)
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that(More)
  • 1