Position

The Chinese University of Hong Kong
Associate Professor, Department of Information Engineering

Affiliated with the Institute of Network Coding (INC)

Contact

Address: Room 706, Ho Sin-Hang Engineering Building, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Email:
Tel: (852) 3943-4326
FAX:(852) 2603-5032

Research Interests:

I am interested in the following areas:

• Network coding

• Network information theory

• Coding theory

• Algorithm design for networks

Links:

PUBLICATIONS AND PATENTS:

Patent

1. S. Jaggi, K. Jain, Patent application 20050010675, “System and method for computing low complexity algebraic network codes for a multicast network.” Link.

Book Chapter

1. S. Jaggi, M. Langberg, “Network Security” in Network coding: fundamentals and applications, Elsevier Inc., 2011 PDF of chapter, book.

Journal Papers

Accepted/Published

1. C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", accepted for publication in the IEEE Transactions on Information Theory. PDF.
2. Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” accepted for publication in the IEEE Transactions on Networking. PDF.
3. B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries, part I: Large Alphabets,”accepted for publication in the IEEE Transactions on Information Theory. PDF.
4. B. K. Dey, S. Jaggi, M. Langberg and A. D. Sarwate, "Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", accepted for publication in the IEEE Transactions on Information Theory, Feb. 2012. PDF.
5. A.-H. Mohsenian-Rad, J. Huang, V.W.S. Wong, S. Jaggi, R. Schober, “Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network,” accepted for publication in the IEEE Transactions on Communications. PDF.
6. A. A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, accepted for publication in the IEEE Transactions on Information Theory. PDF.
7. H. Yao, S. Jaggi, M. Chen, “Passive Network Tomography for Erroneous Networks: A Network Coding Approach,” IEEE Transactions on Information Theory, vol 58, no. 9, 5922-5940. Sept 2012. PDF.
8. T. K. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, E. Erez, “Multiple-access Network Information-flow and Correction Codes,” IEEE Transactions on Information Theory, Special Issue: Facets of Coding Theory: from Algorithms to Networks (in honour of Ralf Koetter), vol 57, no. 2, 1067-1079, Feb. 2011. PDF.
9. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Médard, M. Effros, “Resilient Network Coding in the Presence of Byzantine Adversaries,” IEEE Transactions on Information Theory, June 2008, vol 54, no. 6, 2596-2603. PDF.
10. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, L. Tolhuizen, “Polynomial Time Algorithms for Multicast Network Code Construction,” IEEE Transactions on Information Theory, June 2005, vol 51, no. 6, 1973-1982. PDF.
11. S. Jaggi, A. Joshi, “Incorporating Spatial Variation in Density Enhances the Stability of Simple Population Dynamics Model,” Journal of Theoretical Biology, March 2001, vol. 209, no. 2,pp. 249-255(7). PDF.

Under Review

1. H. Yao, D. Silva, S. Jaggi, M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” submitted to the IEEE Transactions on Networking, Feb. 2012. PDF .
2. S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” submitted to the IEEE Transactions on Information Theory, Jan. 2012. PDF.
3. M. Bakshi, S. Jaggi, S. Cai, M. Chen, “SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits,” submitted to the IEEE Transactions on Information Theory, Nov. 2012. PDF.
4. M. Jahangoshahi, S. Cai, M. Bakshi, S. Jaggi, “GROTESQUE: Noisy Group Testing (Quick and Efficient),” submitted to the IEEE Transactions on Information Theory, Mar. 2013. PDF.
5. S. Cai, M. Bakshi, S. Jaggi, M. Chen, “FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing,” submitted to the IEEE Transactions on Communications, Mar. 2013. PDF.
6. P. H. Che, S. Jaggi, M. Bakshi, M. J. Siavoshani, “Reliable Deniable Communication: Hiding Messages in Noise,” submitted to the IEEE Transactions on Information Theory, Mar. 2013. PDF.

Preprints (Under preparation for submission)

1. B. K. Dey, S. Jaggi, M. Langberg and A. D. Sarwate, "Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", under preparation for submission to the IEEE Transactions on Information Theory. PDF.
2. F. Haddadpour, M. J. Siavoshani, M. Bakshi, S. Jaggi, “On AVCs with Quadratic Constraints,” under preparation for submission to the IEEE Transactions on Information Theory. PDF.

Conference/Workshop Papers

Peer-reviewed papers at conferences/workshops

1. W. Huang, T. Ho, H. Yao, S. Jaggi, “Rateless Resilient Network Coding Against Byzantine Adversaries”, to be presented at INFOCOM 2013, Turin, Italy, Apr 2013. PDF.
2. M. Bakshi, S. Jaggi, S. Cai, M. Chen, “SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits,” presented at Allerton 2012, Oct. 2012. PDF, poster, presentation.
3. S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime: Performance of Network Simplification” presented at ITW 2012. PDF, presentation.
4. S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime: Performance of A Greedy Scheme”, presented at the Network Coding Workshop (NetCod), Boston, 2012. PDF.
5. C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", International Symposium on Information Theory (ISIT), Boston, 2012. PDF.
6. S. Agnihotri, S. Jaggi, and M. Chen, "Analog Network Coding in General SNR Regime", International Symposium on Information Theory (ISIT), Boston, 2012. PDF.
7. B. K. Dey, S. Jaggi, Michael Langberg and A. D. Sarwate, "Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", International Symposium on Information Theory (ISIT), Boston, 2012. PDF.
8. C. L. Chan, P. H. Che, S. Jaggi, V. Saligrama, “Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms”, presented at Allerton 2011, PDF, presentation.
9. Q. Wang, S. Jaggi, S.-Y. Li, “Binary Error Correcting Network Codes”, presented at ITW 2011, Paraty, Brazil PDF, presentation.
10. S. Agnihotri, S. Jaggi, and M. Chen, “Amplify-and-Forward in Wireless Relay Networks”, presented at ITW 2011, Paraty, Brazil, PDF, extended version PDF, presentation.
11. A. A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, presented at ISIT 2011, St. Petersburg, Russia, extended version PDF.
12. Q. (Tyler) Sun, S. Jaggi, and S-Y. (Robert) Li, “Delay Invariant Convolutional Network Codes”, presented at ISIT 2011, St. Petersburg, Russia, docx, presentation.
13. L. Xia, S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” presented at INFOCOM 2011. PDF, presentation.
14. H. Yao, T. K. Dikaliotis, S. Jaggi, T. Ho, “Multi-source operator channels: Efficient capacity-achieving codes,” presented at ITW 2010, Dublin, Ireland. PDF, presentation.
15. M. Bakshi, S. Jaggi,. M. Effros, “Concatenated Polar Codes,” presented at ISIT 2010, Austin, TX, USA. PDF, presentation.
16. B. K. Dey, S. Jaggi, M. Langberg, A. S. Sarwate, “Codes against Delayed Adversaries,” presented at ISIT 2010, Austin, TX. PDF, presentation.
17. H. Yao, D. Silva, S. Jaggi, M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” presented at IEEE International Symposium on Network Coding (NetCod) 2010 PDF, presentation.
18. H. Yao, S. Jaggi, M. Chen, “Passive network tomography for erroneous networks: A network coding approach,” presented at INFOCOM 2010, San Diego, CA. PDF, presentation.
19. Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” presented at INFOCOM 2010. PDF, presentation.
20. B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries,” presented at Allerton 2009. PDF, presentation.
21. S. Jaggi, B. K. Dey, M. Langberg, “Binary Causal-Adversary Channels,” presented at ISIT, Seoul, Korea, July 2009. PDF, presentation.
22. Z. Shao, S. Jaggi. S.-Y. R. Li, “To code or not to code: rate optimality in node-capacitated networks,” presented at ISIT, Seoul, Korea, July 2009. PDF.
23. A.-H. Mohsenian-Rad, J. Huang, V. W.S. Wong, S. Jaggi, R. Schober, “Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding,” presented at ICC, Dresden, Germany, June 2009. Extended version PDF.
24. S. Shenvi, S. Jaggi, B.K. Dey, M. Langberg, “Real Slepian-Wolf Codes,” ISIT 2008, Toronto, ON, Canada. PDF.
25. S. Shintre, S. Jaggi, B. K. Dey, D. Katabi. M. Medard, “ “Real” and “Complex” Network Codes: Promises and Challenges”, 4th International Symposium on Network Coding, 2008, Hong Kong.  PDF.
26. S. Jaggi, M. Langberg, “Resilient Network Coding in the Presence of Eavesdropping Byzantine Adversaries,” ISIT 2007, Nice, France.(Error: Corrected version in NetCod10)
27. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, “Resilient Network Coding in the Presence of Byzantine Adversaries,” INFOCOM 2007, Anchorage, Alaska, USA. PDF, presentation.
28. V. Doshi, D. Shah, M. Médard, S. Jaggi, “Distributed Functional Compression through Graph Coloring,” Data Compression Conference 2007. PDF.
29. V. Doshi, D. Shah, M. Médard, S. Jaggi,  “Graph Coloring and Conditional Graph Entropy,” Asilomar Conference on Signals, Systems, and Computers, November 2006. pp. 2137-2141. PDF.
30. S. Jaggi, Y. Cassuto, M. Effros,, “Low Complexity Encoding for Network Codes,”ISIT 2006, Seattle. PDF.
31. S. Jaggi, M. Langberg, T. Ho, M. Effros, “Correction of Adversarial Errors in Networks,” ISIT 2005, Adelaide, Australia. PDF.
32. S. Jaggi, M. Effros, “Communication and Distributional Complexity of Joint Probability Mass Functions,” ISIT 2004, Chicago, Il, USA. PDF.
33. S. Jaggi, P. A. Chou, K. Jain, “Low Complexity Algebraic Network Multicast Codes,” ISIT 2003, Yokohama, Japan. PDF (one-page).
34. Q. Zhao, S. Jaggi, M. Effros, “Side Information Source Coding: Low-Complexity Design and Source Independence,” Asilomar Conference on Signals and Systems 2002, Monterey, CA, USA. PDF.
35. S. Jaggi, M. Effros, “Universal Linked Multiple Access Source Codes,” ISIT 2002, Lausanne, Switzerland. Extended version PDF.

Papers under review at conferences/workshops

1. S. Cai, M. Bakshi, S. Jaggi, M. Chen, “FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing,” submitted to ISIT 2013, Jan. 2013. PDF, poster.
2. P. H. Che, S. Jaggi, M. Bakshi, M. J. Siavoshani, “Reliable Deniable Communication: Hiding Messages in Noise,” submitted to ISIT 2013, Jan. 2013. PDF, presentation.
3. F. Haddadpour, M. J. Siavoshani, M. Bakshi, S. Jaggi, “On AVCs with Quadratic Constraints,” submitted to ISIT 2013, PDF.
4. P. H. Che, M. Chen, T. Ho, S. Jaggi, M. Langberg, “Routing for Security in Networks with Adversarial Nodes,” submitted to NetCod 2013. PDF.

Invited papers at conferences/workshops

1. T. Dikaliotis, H. Yao, T. Ho, S. Jaggi, and S. Avestimehr, “Computationally efficient near-optimal codes for wireless networks”, to be presented at the International Conference on Signal Processing and Communications (SPCOM), Bangalore, 2012. (Invited paper) PDF, presentation.
2. O. F. Tekin, T. Ho, S. Jaggi, “On erasure correction coding for streaming,” Proceedings of Information Theory and Applications Workshop, UCSD, 2012, (Invited paper). PDF.
3. H. Yao, S. Jaggi, M. Chen, “Network RS codes: Efficient Byzantine adversary Localization,” presented at Asilomar 2010. (Invited paper) PDF, presentation.
4. G. Sharma, S. Jaggi, B. K. Dey, “Network Coding tomography,” (Invited paper), ITA Workshop, San Diego, CA, USA, 2008. PDF, presentation.
5. S. Katti, S. Shintre, S. Jaggi, D. Katabi, M. Medard, “Real Network Codes”, (Invited paper), 45th Allerton Conference, Allerton, 2007. PDF.
6. S. Jaggi, M. Effros, T. Ho, M. Médard, “On Linear Network Coding,” (Invited paper), 42nd Allerton Conference, Allerton, 2004 USA. PDF.

Invited talks at conferences/workshops

1. S. Cai, M. Bakshi, S. Jaggi, M. Chen, “A Better TOMORROW: A Fast Algorithm for Network Tomography with Few Probes,” presented at the Information Theory and Applications (ITA) Workshop, UCSD, 2013, presentation.
2. C. L. Chan, S. Jaggi, V. Saligrama, S. Agnihotri, “Compressive sensing meets group testing: LP decoding for non-linear (disjunctive) measurements,” presented at the Information Theory and Applications (ITA) Workshop, UCSD, 2012, presentation.
3. L. Xia, S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,”, Information Theory and Statistic for large alphabets Workshop, Banff International Research Station, Oct. 2011.
4. T. Dikaliotis, H. Yao, T. Ho, S. Jaggi, and S. Avestimehr, “Computationally efficient near-optimal codes for wireless networks”, presented at the Information Theory and Applications (ITA) Workshop, UCSD, 2011.  presentation.
5. M. Alamgir, S. Jaggi, H. Yao, “Obfuscated network codes,” presented at the Information Theory Workshop (ITW)  2010, Dublin, Ireland.
6. P. H. Che, K. S. Man, S. Jaggi, “Non-adaptive combinatorial group testing,” presented at the Information Theory and Applications (ITA) Workshop, UCSD, Feb 2010.
7. S. Jaggi, M. Langberg, B. K. Dey, “Causal-Adversarial Channels,” presented at the Information Theory and Applications (ITA) Workshop, UCSD, January 2009. presentation.
8. S. Jaggi, T. Ho, M. Effros, “Zero-error Distributed Network Codes,” presented at the Information Theory and Applications (ITA) Workshop, UCSD, 2007.

INVITED TUTORIALS

        “Network coding”, Invited Tutorial, ICOIN, Busan, Korea.                                                      Jan 2010

        “Network coding”, Invited Tutorial, HK-Taiwan-Macau Joint workshop on IT, Macau.     August 2009

        “Network coding security”, Invited Tutorial, NetCod 2009, EPFL, Lausanne, Switzerland.     July 2009

Sidharth Jaggi received his Bachelor of Technology degree from the Indian Institute of Technology in 2000, and his Master of Science and Ph.D. degrees from the California institute of Technology in 2001 and 2006 respectively, all in electrical engineering. He was awarded the Caltech Division of Engineering Fellowship 2001-'02, and the Microsoft Research Fellowship for the years 2002-'04. He interned at Microsoft Research, (Redmond, WA, USA) in the summers of 2002-'03 and engaged in research on network coding. He spent 2006 as a Postdoctoral Associate at the Laboratory of Information and Decision Systems at the Massachusetts Institute of Technology. He joined the Department of Information Engineering, the Chinese University of Hong Kong in 2007.

Sidharth's research interests lie at the intersection of information theory, algorithms, and networking. His teams thus (somewhat unwillingly) calls itself the CAN-DO-IT team (Codes, Algorithms, Networks: Design and Optimization for Information Theory). He is currently particularly interested in the field of network coding which neatly merges practice and theory in all three of these fields. However, his interests are eclectic (above all, he likes a good challenge) and he has dabbled in communication complexity, quantum computation, coding theory, random matrix theory, and signal.

You can find my CV here.