Sidharth Jaggi

Dept. of Information Engineering., Chinese University of Hong Kong, Shatin, N.T., Hong Kong

Ph No: (+852) 3163 4326, Fax. No: (+852) 2603 5032,

jaggi@ie.cuhk.edu.hk Official department website

POSITION:

Chinese University of Hong Kong 2007- present

Assistant Professor, Department of Information Engineering

Experience:

Post-doctoral Associate, Massachusetts Institute of Technology 2006

Laboratory of Information and Decision Sciences

Graduate Studies, California Institute of Technology 2000-2005

Network coding. Network information theory, algorithms. Slepian-Wolf codes, communication complexity.

MSR Fellowship Internship, Microsoft Research, Redmond, WA., USA Summer 2003

Average-time quantum search algorithms.

MSR Fellowship Internship, Microsoft Research, Redmond, WA., USA Summer 2002

Developed the first polynomial-time algorithm for network multicast codes.

Education:

California Institute of Technology 2001-2005

Ph.D. Electrical Engineering (Research Advisor: Michelle Effros)

Thesis: Design and Analysis of Network Codes

M.S. Electrical Engineering 2000-2001

Indian Institute of Technology, Bombay

B.Tech. Electrical Engineering 1996-2000

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

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

Journal Papers

[3] H. Yao, D. Silva, S. Jaggi, M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” under submission to the IEEE Transactions on Information Theory, Feb. 2012 PDF

[4] C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", under submission to the IEEE Transactions on Information Theory, Feb. 2012. PDF.

[5] B. K. Dey, S. Jaggi, M. Langberg and A. D. Sarwate, "Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", under submission to the IEEE Transactions on Information Theory, Feb. 2012.

[6] Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” submitted to the IEEE Transactions on Networking, Jan 2012. PDF.

[7] S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” submitted to the IEEE Transactions on Information Theory, Jan. 2012. PDF,

[8] A. A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, submitted to the IEEE Transactions on Information Theory, Aug 2011. PDF.

[9] 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), Feb. 2011. PDF.

[10] H. Yao, S. Jaggi, M. Chen, “Network coding tomography for network failures,” accepted for publication in the IEEE Transactions on Information Theory, Oct. 2011. PDF

[11] B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries,” submitted to the IEEE Transactions on Information Theory, Jan 2011. PDF

[12] 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,” submitted to the IEEE Transactions on Communications, April 2011. PDF

[13] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, 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

[14] 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

[15] 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.

Conference/Workshop Papers

[16] C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", submitted to the International Symposium on Information Theory (ISIT), Boston, 2012. PDF.

[17] S. Agnihotri, S. Jaggi, and M. Chen, "Analog Network Coding in General SNR Regime", submitted to the International Symposium on Information Theory (ISIT), Boston, 2012. PDF.

[18] B. K. Dey, S. Jaggi, Michael Langberg and A. D. Sarwate, "Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", submitted to the International Symposium on Information Theory (ISIT), Boston, 2012. PDF.

[19] C. L. Chan, S. Jaggi, V. Saligrama, S. Agnihotri, “Compressive sensing meets group testing: LP decoding for non-linear (disjunctive) measurements,” Information Theory and Applications Workshop, 2012, Invited talk.

[20] O. F. Tekin, T. Ho, S. Jaggi, “On erasure correction coding for streaming,” Proceedings of Information Theory and Applications Workshop, 2012, Invited paper. PDF.

[21] 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

[22] Q. Wang, S. Jaggi, S.-Y. Li, “Binary Error Correcting Network Codes”, presented at ITW 2011, Paraty, Brazil PDF, presentation.

[23] 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

[24] 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

[25] Q. (Tyler) Sun, S. Jaggi, and S-Y. (Robert) Li, “Delay Invariant Convolutional Network Codes”, presented at ISIT 2011, St. Petersburg, Russia, docx, presentation.

[26] T. Dikaliotis, H. Yao, T. Ho, S. Jaggi, and S. Avestimehr, “Computationally efficient near-optimal codes for wireless networks”, ITA UCSD 2011. PDF, presentation.

[27] L. Xia, S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” presented at INFOCOM 2011. PDF, presentation.

[28] H. Yao, S. Jaggi, M. Chen, “Network RS codes: Efficient Byzantine adversary Localization,” presented at Asilomar 2010. (Invited paper) PDF, presentation

[29] M. Alamgir, S. Jaggi, H. Yao, “Obfuscated network codes,” presented at ITW 2010, Dublin, Ireland. (Invited talk)

[30] 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

[31] M. Bakshi, S. Jaggi,. M. Effros, “Concatenated Polar Codes,” presented at ISIT 2010, Austin, TX, USA. PDF, presentation

[32] B. K. Dey, S. Jaggi, M. Langberg, A. S. Sarwate, “Codes against Delayed Adversaries,” presented at ISIT 2010, Austin, TX. PDF, presentation

[33] 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

[34] 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

[35] Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” presented at INFOCOM 2010. PDF, presentation

[36] P. H. Che, K.S. Man, S. Jaggi, “Non-adaptive combinatorial group testing,” presented at ITA workshop, UCSD, Feb 2010.

[37] B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries,” presented at Allerton 2009. PDF, presentation.

[38] S. Jaggi, B. K. Dey, M. Langberg, “Binary Causal-Adversary Channels,” presented at ISIT, Seoul, Korea, July 2009. PDF, presentation

[39] 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

[40] 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

[41] S. Jaggi, M. Langberg, B. K. Dey, “Causal-Adversarial Channels,” Invited talk, presented at ITA, UCSD, San Diego CA, January 2009. presentation

[42] S. Shenvi, S. Jaggi, B.K. Dey, M. Langberg, “Real Slepian-Wolf Codes,” ISIT 2008, Toronto, ON, Canada. PDF

[43] G. Sharma, S. Jaggi, B. K. Dey, “Network Coding tomography,” Invited talk, ITA Workshop, San Diego, CA, USA, 2008. PDF, presentation

[44] S. Shintre, S. Jaggi, B. K. Dey, D. Katabi. M. Medard, “ “Real” and “Complex” Network Codes: Promises and Challenges”, 4^th International Symposium on Network Coding, 2008, Hong Kong. PDF

[45] S. Katti, S. Shintre, S. Jaggi, D. Katabi, M. Medard, “Real Network Codes”, Invited paper, 45^th Allerton Conference, Allerton, 2007 PDF

[46] S. Jaggi, M. Langberg, “Resilient Network Coding in the Presence of Eavesdropping Byzantine Adversaries,” ISIT 2007, Nice, France.(Error: Corrected version in NetCod10)

[47] 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

[48] V. Doshi, D. Shah, M. Medard, S. Jaggi, “Distributed Functional Compression through Graph Coloring,”, Data Compression Conference 2007. PDF

[49] S. Jaggi, T. Ho, M. Effros, “Zero-error Distributed Network Codes,” Invited talk, ITA Workshop, San Diego, CA, USA, 2007.

[50] 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

[51] S. Jaggi, Y. Cassuto, M. Effros,, “Low Complexity Encoding for Network Codes,”ISIT 2006, Seattle. PDF

[52] S. Jaggi, M. Langberg, T. Ho, M. Effros, “Correction of Adversarial Errors in Networks,” ISIT 2005, Adelaide, Australia. PDF

[53] S. Jaggi, M. Effros, T. Ho, M. Médard, “On Linear Network Coding,” Invited talk, 42nd Allerton Conference, Allerton, USA. PDF

[54] S. Jaggi, M. Effros, “Communication and Distributional Complexity of Joint Probability Mass Functions,” ISIT 2004, Chicago, Il, USA. PDF

[55] S. Jaggi, P. A. Chou, K. Jain, “Low Complexity Algebraic Network Multicast Codes,” ISIT 2003, Yokohama, Japan. PDF (one-page)

[56] 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

[57] S. Jaggi, M. Effros, “Universal Linked Multiple Access Source Codes,” ISIT 2002, Lausanne, Switzerland. Extended version PDF

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