default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalaji Srinivasan Babu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]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): 4303-4332 (2023)- 2022
- [j5]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): 547-813 (2022) - [j4]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): 6452-6471 (2022) - 2020
- [j3]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): 1023-1052 (2020)
2010 – 2019
- 2019
- [j2]N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar:
Codes With Locality for Two Erasures. IEEE Trans. Inf. Theory 65(12): 7771-7789 (2019) - 2018
- [j1]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): 100301:1-100301:45 (2018) - [c7]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: 2376-2380 - [c6]Balaji Srinivasan Babu, P. Vijay Kumar:
A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes. ISIT 2018: 2381-2385 - [i11]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. CoRR abs/1801.06794 (2018) - [i10]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 abs/1804.00598 (2018) - [i9]Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar:
Erasure Coding for Distributed Storage: An Overview. CoRR abs/1806.04437 (2018) - [i8]Balaji Srinivasan Babu, P. Vijay Kumar:
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions. CoRR abs/1806.04474 (2018) - [i7]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 abs/1812.02502 (2018) - 2017
- [c5]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: 1778-1782 - [c4]Balaji Srinivasan Babu, P. Vijay Kumar:
Bounds on the rate and minimum distance of codes with availability. ISIT 2017: 3155-3159 - [i6]Balaji Srinivasan Babu, P. Vijay Kumar:
A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes. CoRR abs/1710.05876 (2017) - 2016
- [c3]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary codes with locality for multiple erasures having short block length. ISIT 2016: 655-659 - [i5]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary Codes with Locality for Multiple Erasures Having Short Block Length. CoRR abs/1601.07122 (2016) - [i4]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary Codes with Locality for Four Erasures. CoRR abs/1607.02817 (2016) - [i3]Balaji Srinivasan Babu, P. Vijay Kumar:
Bounds on Codes with Locality and Availability. CoRR abs/1611.00159 (2016) - [i2]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures. CoRR abs/1611.08561 (2016) - 2015
- [c2]Balaji Srinivasan Babu, P. Vijay Kumar:
On partial maximally-recoverable and maximally-recoverable codes. ISIT 2015: 1881-1885 - [i1]Balaji Srinivasan Babu, P. Vijay Kumar:
On Partial Maximally-Recoverable and Maximally-Recoverable Codes. CoRR abs/1501.07130 (2015) - 2014
- [c1]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: 885-902
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
