Следене
Sidharth (Sid) Jaggi
Sidharth (Sid) Jaggi
Professor, School of Mathematics, University of Bristol
Потвърден имейл адрес: bristol.ac.uk - Начална страница
Заглавие
Позовавания
Позовавания
Година
Polynomial time algorithms for multicast network code construction
S Jaggi, P Sanders, PA Chou, M Effros, S Egner, K Jain, LMGM Tolhuizen
Information Theory, IEEE Transactions on 51 (6), 1973-1982, 2005
11892005
Resilient network coding in the presence of byzantine adversaries
S Jaggi, M Langberg, S Katti, T Ho, D Katabi, M Médard
INFOCOM 2007. 26th IEEE International Conference on Computer Communications …, 2007
6832007
Non-adaptive group testing: Explicit bounds and novel algorithms
CL Chan, S Jaggi, V Saligrama, S Agnihotri
IEEE Transactions on Information Theory 60 (5), 3019-3035, 2014
311*2014
Reliable deniable communication: Hiding messages in noise
PH Che, M Bakshi, S Jaggi
2013 IEEE International Symposium on Information Theory, 2945-2949, 2013
2902013
Low complexity algebraic multicast network codes
S Jaggi, PA Chou, K Jain
In IEEE International Symposium on Information Theory (ISIT, 2003
155*2003
Ripple authentication for network coding
Y Li, H Yao, M Chen, S Jaggi, A Rosen
INFOCOM, 2010 Proceedings IEEE, 1-9, 2010
1322010
Correction of adversarial errors in networks
S Jaggi, M Langberg, T Ho, M Effros
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005
912005
Concatenated polar codes
M Bakshi, S Jaggi, M Effros
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on …, 2010
892010
Reliable deniable communication with channel uncertainty
PH Che, M Bakshi, C Chan, S Jaggi
2014 IEEE information theory workshop (ITW 2014), 30-34, 2014
772014
System and method for computing low complexity algebraic network codes for a multicast network
S Jaggi, K Jain
US Patent 7,574,518, 2009
642009
Real and complex network codes: Promises and challenges
BK Dey, S Katti, S Jaggi, D Katabi, M Médard, S Shintre
Network Coding, Theory and Applications, 2008. NetCod 2008. Fourth Workshop …, 2008
59*2008
Group testing with prior statistics
T Li, CL Chan, W Huang, T Kaced, S Jaggi
2014 IEEE International Symposium on Information Theory, 2346-2350, 2014
582014
Passive network tomography for erroneous networks: A network coding approach
H Yao, S Jaggi, M Chen
IEEE Transactions on Information Theory 58 (9), 5922-5940, 2012
56*2012
Efficient algorithms for noisy group testing
S Cai, M Jahangoshahi, M Bakshi, S Jaggi
IEEE Transactions on Information Theory 63 (4), 2113-2136, 2017
542017
Grotesque: noisy group testing (quick and efficient)
S Cai, M Jahangoshahi, M Bakshi, S Jaggi
2013 51st Annual Allerton Conference on Communication, Control, and …, 2013
472013
On linear network coding
S Jaggi, M Effros, T Ho, M Médard
Proc. of the 42nd Allerton Conference, 2004
472004
Nearly optimal sparse group testing
V Gandikota, E Grigorescu, S Jaggi, S Zhou
IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019
452019
Low complexity encoding for network codes
S Jaggi, Y Cassuto, M Effros
2006 IEEE International Symposium on Information Theory, 40-44, 2006
442006
Upper bounds on the capacity of binary channels with causal adversaries
BK Dey, S Jaggi, M Langberg, AD Sarwate
IEEE Transactions on Information Theory 59 (6), 3753-3763, 2013
43*2013
Sufficiently myopic adversaries are blind
BK Dey, S Jaggi, M Langberg
IEEE Transactions on Information Theory 65 (9), 5718-5736, 2019
422019
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20