Codes against Online Adversaries (2008)
Dey, Bikash Kumar, Jaggi, Sidharth, Langberg, Michael
In this work we consider the communication of information in the presence of an online adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by...
"Real" Slepian-Wolf Codes (2008)
Dey, Bikash Kumar, Jaggi, Sidharth, Langberg, Michael
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical...
Resilient Network Coding in the Presence of Byzantine Adversaries (2008)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracey, Katabi, Dina, Médard, Muriel, ...
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Resilient Network Coding In the Presence of Byzantine Adversaries (2006)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracy, Katabi, Dina, Medard, Muriel
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Resilient Network Coding In the Presence of Byzantine Adversaries (2006)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracy, Katabi, Dina, Medard, Muriel
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Design and analysis of network codes (2006)
The information theoretic aspects of large networks with many terminals present several interesting and non-intuitive phenomena. One such crucial phenomenon was first explored in a detailed manner in...
Design and analysis of network codes (2005)
The information theoretic aspects of large networks with many terminals present several interesting and non-intuitive phenomena. One such crucial phenomenon was first explored in a detailed manner in...
Polynomial time algorithms for multicast network code construction (2005)
Jaggi, Sidharth, Sanders, Peter, Chou, Philip A., Effros, Michelle, Egner, Sebastian, Jain, Kamal, ...
The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has...
Communication and distributional complexity of joint probability mass functions (2004)
Jaggi, Sidharth, Effros, Michelle
The problem of truly-lossless (Pe = 0) distributed source coding [1] requires knowledge of the joint statistics of the sources. In particular the locations of the zeroes of the probability mass...
Polynomial Time Algorithms for Multicast Network Code Construction (2003)
Sidharth Jaggi, Peter Sanders, Philip A. Chou, Sebastian Egner, Kamal Jain, Ludo Tolhuizen
The famous max-ow min-cut theorem states that a source node s can send information through a network (V; E) to a sink node t at a rate determined by the min-cut separating s and t. Recently it has...
Low Complexity Algebraic Multicast Network Codes (2003)
Sidharth Jaggi, Philip A. Chou, Kamal Jain
We present a low complexity algorithm for designing algebraic codes that achieve the information theoretic capacity for the multicast problem on directed acyclic networks. These codes operate over...
Low Complexity Algebraic Multicast Network Codes (2003)
Sidharth Jaggi, Philip A. Chou, Kamal Jain
We present a low complexity algorithm for designing algebraic codes that achieve the information theoretic capacity for the multicast problem on directed acyclic networks.
Side information source coding: low complexity design and source independence (2002)
Zhao, Qian, Jaggi, Sidharth, Effros, Michelle
Correlated sources X and Y are drawn i.i.d. according to probability mass function (pmf) p(x,y). In the side information source code (SISC) configuration: p(x,y) is known a priori to both the encoder...
Universal linked multiple access source codes (2002)
Jaggi, Sidharth, Effros, Michelle
We consider the multiple access source coding (MASC) problem (also known as the Slepian-Wolf problem) for situations where the joint source statistics are unknown a priori. Since neither encoder...