Swanand Kadhe
TitleCited byYear
Codes with unequal locality
S Kadhe, A Sprintson
2016 IEEE International Symposium on Information Theory (ISIT), 435-439, 2016
272016
Private information retrieval with side information
S Kadhe, B Garcia, A Heidarzadeh, SE Rouayheb, A Sprintson
arXiv preprint arXiv:1709.00112, 2017
262017
Analyzing the download time of availability codes
S Kadhe, E Soljanin, A Sprintson
2015 IEEE International Symposium on Information Theory (ISIT), 1467-1471, 2015
242015
Reliable, deniable, and hidable communication over multipath networks
S Kadhe, S Jaggi, M Bakshi, A Sprintson
2014 IEEE International Symposium on Information Theory, 611-615, 2014
152014
Private information retrieval with side information: The single server case
S Kadhe, B Garcia, A Heidarzadeh, S El Rouayheb, A Sprintson
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
132017
Weakly secure regenerating codes for distributed storage
S Kadhe, A Sprintson
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
132014
Reliable, deniable and hidable communication: A quick survey
PH Che, S Kadhe, M Bakshi, C Chan, S Jaggi, A Sprintson
2014 IEEE Information Theory Workshop (ITW 2014), 227-231, 2014
122014
System and method for exact regeneration of a failed node in a distributed storage system
S Kadhe, B Janakiram, MG Chandra, B Purushothaman
US Patent 8,775,860, 2014
122014
A framework for non intrusive load monitoring using bayesian inference
K Srinivasarengan, YG Goutam, MG Chandra, S Kadhe
2013 Seventh International Conference on Innovative Mobile and Internet …, 2013
122013
SpreadStore: a LDPC erasure code scheme for distributed storage system
B Janakiram, MG Chandra, KG Aravind, S Kadhe, P Balamuralidhar, ...
2010 InTernaTional conference on DaTa STorage and DaTa engineering, 154-158, 2010
122010
On the capacity of single-server multi-message private information retrieval with side information
A Heidarzadeh, B Garcia, S Kadhe, S El Rouayheb, A Sprintson
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
112018
Rate optimal binary linear locally repairable codes with small availability
S Kadhe, R Calderbank
2017 IEEE International Symposium on Information Theory (ISIT), 166-170, 2017
92017
When do the availability codes make the stored data more available?
S Kadhe, E Soljanin, A Sprintson
2015 53rd Annual Allerton Conference on Communication, Control, and …, 2015
92015
On a weakly secure regenerating code construction for minimum storage regime
S Kadhe, A Sprintson
2014 52nd Annual Allerton Conference on Communication, Control, and …, 2014
92014
Synthesis of logical Clifford operators via symplectic geometry
N Rengaswamy, R Calderbank, HD Pfister, S Kadhe
2018 IEEE International Symposium on Information Theory (ISIT), 791-795, 2018
62018
On the service capacity region of accessing erasure coded content
M Aktaş, SE Anderson, A Johnston, G Joshi, S Kadhe, GL Matthews, ...
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
62017
Talking reliably, secretly, and efficiently: A “complete” characterization
Q Zhang, S Kadhe, M Bakshi, S Jaggi, A Sprintson
2015 IEEE Information Theory Workshop (ITW), 1-5, 2015
62015
Reliable data transmission in sensor networks using compressive sensing and real expander codes
S Kadhe, S Thaskani, MG Chandra, BS Adiga
2012 National Conference on Communications (NCC), 1-5, 2012
62012
Coding against a limited-view adversary: The effect of causality and feedback
Q Zhang, S Kadhe, M Bakshi, S Jaggi, A Sprintson
Information Theory (ISIT), 2015 IEEE International Symposium on, 2530-2534, 2015
52015
Reliable and secure communication over adversarial multipath networks: A survey
S Kadhe, A Sprintson, QE Zhang, M Bakshi, S Jaggi
2015 10th International Conference on Information, Communications and Signal …, 2015
42015
The system can't perform the operation now. Try again later.
Articles 1–20