Balaji Srinivasan Babu

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