Balaji Srinivasan Babu

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 21

Top Topics

Distributed Storage

Minimum Distance

Top Venues

IEEE Trans. Inf. Theory

Sci. China Inf. Sci.

Publications

Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar
Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size. IEEE Trans. Inf. Theory 69 (7) (2023)
Vinayak Ramkumar, Balaji Srinivasan Babu, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar
Codes for Distributed Storage. Found. Trends Commun. Inf. Theory 19 (4) (2022)
Balaji Srinivasan Babu, Myna Vajha, P. Vijay Kumar
Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound. IEEE Trans. Inf. Theory 68 (10) (2022)
Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures. IEEE Trans. Inf. Theory 66 (2) (2020)
N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar
Codes With Locality for Two Erasures. IEEE Trans. Inf. Theory 65 (12) (2019)
Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures. CoRR (2018)
Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar
A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. CoRR (2018)
Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar
Erasure Coding for Distributed Storage: An Overview. CoRR (2018)
Balaji Srinivasan Babu, P. Vijay Kumar
A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes. ISIT (2018)
Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$. ISIT (2018)
Balaji Srinivasan Babu, P. Vijay Kumar
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions. CoRR (2018)
Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar
Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61 (10) (2018)
Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3. CoRR (2018)
Balaji Srinivasan Babu, P. Vijay Kumar
Bounds on the rate and minimum distance of codes with availability. ISIT (2017)
Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar
A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. ISIT (2017)
Balaji Srinivasan Babu, P. Vijay Kumar
A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes. CoRR (2017)
Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar
A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures. CoRR (2016)
Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar
Binary codes with locality for multiple erasures having short block length. ISIT (2016)
Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar
Binary Codes with Locality for Multiple Erasures Having Short Block Length. CoRR (2016)
Balaji Srinivasan Babu, P. Vijay Kumar
Bounds on Codes with Locality and Availability. CoRR (2016)
Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar
Binary Codes with Locality for Four Erasures. CoRR (2016)
Balaji Srinivasan Babu, P. Vijay Kumar
On partial maximally-recoverable and maximally-recoverable codes. ISIT (2015)
Balaji Srinivasan Babu, P. Vijay Kumar
On Partial Maximally-Recoverable and Maximally-Recoverable Codes. CoRR (2015)
Harish G. Ramaswamy, Balaji Srinivasan Babu, Shivani Agarwal, Robert C. Williamson
On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems. COLT (2014)