default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBirenjith Sasidharan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]K. S. Ajish Kumar
, Birenjith Sasidharan, K. S. Sudeep:
On oriented diameter of (n,k)-star graphs. Discret. Appl. Math. 354: 214-228 (2024)- [j9]Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau:
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding. Des. Codes Cryptogr. 92(12): 4247-4277 (2024) - [j8]Birenjith Sasidharan, Emanuele Viterbo, Yi Hong:
Alternative Zero Codebooks for MOCZ With Reduced PAPR. IEEE Commun. Lett. 28(7): 1524-1528 (2024) - [c19]Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau:
On ML Decoding of Binary Cyclic-gap Constant Weight Codes. ISIT 2024: 2826-2831 - [i23]Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau:
A Family of Low-Complexity Binary Codes with Constant Hamming Weights. CoRR abs/2401.16647 (2024) - [i22]Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau:
Block Circulant Codes with Application to Decentralized Systems. CoRR abs/2406.12160 (2024) - 2023
- [c18]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. ISIT 2023: 2547-2552 - [i21]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. CoRR abs/2311.14116 (2023) - 2022
- [j7]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) - [j6]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. IEEE J. Sel. Areas Commun. 40(3): 761-772 (2022) - [c17]Birenjith Sasidharan, Emanuele Viterbo:
Private Balance-Checking on Blockchain Accounts Using Private Integer Addition. ISIT 2022: 2207-2212 - [i20]Birenjith Sasidharan, Emanuele Viterbo:
Private Balance-Checking on Blockchain Accounts Using Private Integer Addition. IACR Cryptol. ePrint Arch. 2022: 950 (2022) - 2021
- [c16]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. ISIT 2021: 2286-2291 - [c15]Birenjith Sasidharan, Emanuele Viterbo:
Private Data Access in Blockchain Systems Employing Coded Sharding. ISIT 2021: 2684-2689 - [i19]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. CoRR abs/2105.02919 (2021) - [i18]K. S. Ajish Kumar, Birenjith Sasidharan, K. S. Sudeep:
On Oriented Diameter of $(n, k)$-Star Graphs. CoRR abs/2105.08308 (2021) - 2020
- [i17]Vinayak Ramkumar, Myna Vajha, S. B. Balaji, M. Nikhil Krishnan, Birenjith Sasidharan, P. Vijay Kumar:
Codes for Distributed Storage. CoRR abs/2010.01344 (2020)
2010 – 2019
- 2018
- [j5]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) - [c14]Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi:
Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018: 139-154 - [i16]D. Shivakrishna, V Arvind Rameshwar, V. Lalitha, Birenjith Sasidharan:
On Maximally Recoverable Codes for Product Topologies. CoRR abs/1801.03379 (2018) - [i15]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) - 2017
- [c13]Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar:
An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1). ISIT 2017: 2048-2052 - [i14]Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar:
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and d<(n-1). CoRR abs/1701.07447 (2017) - 2016
- [j4]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes. Int. J. Inf. Coding Theory 3(4): 255-298 (2016) - [i13]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes. CoRR abs/1606.04467 (2016) - [i12]Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar:
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair. CoRR abs/1607.07335 (2016) - 2015
- [j3]Chao Tian, Birenjith Sasidharan, Vaneet Aggarwal, Vinay A. Vaishampayan, P. Vijay Kumar:
Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs. IEEE Trans. Inf. Theory 61(4): 1933-1947 (2015) - [c12]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
Codes with hierarchical locality. ISIT 2015: 1257-1261 - [c11]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
A high-rate MSR code with polynomial sub-packetization level. ISIT 2015: 2051-2055 - [c10]Kaushik Senthoor, Birenjith Sasidharan, P. Vijay Kumar:
Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets. ITW 2015: 1-5 - [c9]Gaurav Kumar Agarwal, Birenjith Sasidharan, P. Vijay Kumar:
An alternate construction of an access-optimal regenerating code with optimal sub-packetization level. NCC 2015: 1-6 - [i11]Gaurav Kumar Agarwal, Birenjith Sasidharan, P. Vijay Kumar:
An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level. CoRR abs/1501.04760 (2015) - [i10]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
A High-Rate MSR Code With Polynomial Sub-Packetization Level. CoRR abs/1501.06662 (2015) - [i9]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
Codes With Hierarchical Locality. CoRR abs/1501.06683 (2015) - 2014
- [c8]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. HotStorage 2014 - [c7]Birenjith Sasidharan, P. Vijay Kumar, Nihar B. Shah, K. V. Rashmi, K. Ramachandran:
Optimality of the product-matrix construction for secure MSR regenerating codes. ISCCSP 2014: 10-14 - [c6]Birenjith Padmakumari Sasidharan, Kaushik Senthoor, P. Vijay Kumar:
An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes. ISIT 2014: 2430-2434 - [i8]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. CoRR abs/1406.6783 (2014) - [i7]Chao Tian, Birenjith Sasidharan, Vaneet Aggarwal, Vinay A. Vaishampayan, P. Vijay Kumar:
Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs. CoRR abs/1408.0377 (2014) - 2013
- [j2]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint. IEEE Trans. Inf. Theory 59(6): 3875-3891 (2013) - [c5]Birenjith Sasidharan, P. Vijay Kumar:
On the interior points of the storage-repair bandwidth tradeoff of regenerating codes. Allerton 2013: 788-795 - [c4]Birenjith Sasidharan, P. Vijay Kumar:
High-rate regenerating codes through layering. ISIT 2013: 1611-1615 - [i6]Birenjith Sasidharan, P. Vijay Kumar:
High-Rate Regenerating Codes Through Layering. CoRR abs/1301.6157 (2013) - [i5]Birenjith Sasidharan, Kaushik Senthoor, P. Vijay Kumar:
An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes. CoRR abs/1312.6079 (2013) - 2012
- [j1]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multihop Networks: End Points and Computational Tools. IEEE Trans. Inf. Theory 58(2): 804-819 (2012)
2000 – 2009
- 2008
- [c3]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Diversity and degrees of freedom of cooperative wireless networks. ISIT 2008: 1253-1257 - [c2]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks. ISIT 2008: 2076-2080 - [c1]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks. ISIT 2008: 2081-2085 - [i4]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design. CoRR abs/0802.1888 (2008) - [i3]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Diversity and Degrees of Freedom of Cooperative Wireless Networks. CoRR abs/0802.1893 (2008) - [i2]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part I: Basic Results. CoRR abs/0808.0234 (2008) - [i1]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance. CoRR abs/0808.0235 (2008)
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-21 00:02 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:
