Balaji Srinivasan Babu

According to our database, Balaji Srinivasan Babu authored at least 17 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size.

Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar

IEEE Trans. Inf. Theory, July, 2023

2022

Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound.

Balaji Srinivasan Babu, Myna Vajha, P. Vijay Kumar

IEEE Trans. Inf. Theory, 2022

Codes for Distributed Storage.

Vinayak Ramkumar, Balaji Srinivasan Babu, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar

Found. Trends Commun. Inf. Theory, 2022

2020

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures.

Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar

IEEE Trans. Inf. Theory, 2020

2019

Codes With Locality for Two Erasures.

N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar

IEEE Trans. Inf. Theory, 2019

2018

Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions.

Balaji Srinivasan Babu, P. Vijay Kumar

CoRR, 2018

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length.

Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar

CoRR, 2018

Erasure coding for distributed storage: an overview.

Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar

Sci. China Inf. Sci., 2018

Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$.

Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes.

Balaji Srinivasan Babu, P. Vijay Kumar

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Bounds on the rate and minimum distance of codes with availability.

Balaji Srinivasan Babu, P. Vijay Kumar

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Binary Codes with Locality for Four Erasures.

Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar

CoRR, 2016

A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures.

Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar

CoRR, 2016

Bounds on Codes with Locality and Availability.

Balaji Srinivasan Babu, P. Vijay Kumar

CoRR, 2016

Binary codes with locality for multiple erasures having short block length.

Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

On partial maximally-recoverable and maximally-recoverable codes.

Balaji Srinivasan Babu, P. Vijay Kumar

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems.

Harish G. Ramaswamy, Balaji Srinivasan Babu, Shivani Agarwal, Robert C. Williamson

Proceedings of The 27th Conference on Learning Theory, 2014