|
 | Up a level |
Balaji, SB and Kumar, P Vijay (2018) A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 2381-2385.
Balaji, SB and Kumar, Vijay P (2017) Bounds on the Rate and Minimum Distance of Codes with Availability. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY.
Balaji, SB and Kini, Gancsh R and Kumar, Vijay P (2017) A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 1778-1782.
Balaji, SB and Prasanth, KP and Kumar, Vijay P (2016) Binary Codes with Locality for Multiple Erasures Having Short Block Length. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 655-659.
Balaji, SB and Kumar, Vijay P (2015) On Partial Maximally-Recoverable and Maximally-Recoverable Codes. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 1881-1885.
Balaji, SB and Krishnan, Nikhil M and Vajha, Myna and Ramkumar, Vinayak and Sasidharan, Birenjith and Kumar, Vijay P (2018) Erasure coding for distributed storage: an overview. In: SCIENCE CHINA-INFORMATION SCIENCES, 61 (10).
