default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanthosh Kumar
- > Home > Persons > Santhosh Kumar
Publications
- 2017
[j5]Shrinivas Kudekar, Santhosh Kumar
, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller Codes Achieve Capacity on Erasure Channels. IEEE Trans. Inf. Theory 63(7): 4298-4316 (2017)- 2016
- [c10]Santhosh Kumar, A. Robert Calderbank, Henry D. Pfister:
Reed-Muller codes achieve capacity on the quantum erasure channel. ISIT 2016: 1750-1754 - [c9]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Rüdiger L. Urbanke:
Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels. ISIT 2016: 1755-1759 - [c8]Santhosh Kumar, A. Robert Calderbank, Henry D. Pfister:
Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels. ITW 2016: 241-245 - [c7]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller codes achieve capacity on erasure channels. STOC 2016: 658-669 - [i11]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller Codes Achieve Capacity on Erasure Channels. CoRR abs/1601.04689 (2016) - [i10]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Rüdiger L. Urbanke:
Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels. CoRR abs/1601.06048 (2016) - 2015
- [c6]Santhosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister:
Spatially-coupled codes for write-once memories. Allerton 2015: 125-131 - [i7]Santhosh Kumar, Henry D. Pfister:
Reed-Muller Codes Achieve Capacity on Erasure Channels. CoRR abs/1505.05123 (2015) - 2014
- [j3]Santhosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister:
Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels. IEEE Trans. Inf. Theory 60(12): 7389-7415 (2014) - [c5]Santhosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister:
Spatially-coupled codes for side-information problems. ISIT 2014: 516-520 - 2013
- [j2]Santhosh Kumar, Jean-François Chamberland, Henry D. Pfister:
First-Passage Time and Large-Deviation Analysis for Erasure Channels With Memory. IEEE Trans. Inf. Theory 59(9): 5547-5565 (2013) - [i5]Santhosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister:
A Proof of Threshold Saturation for Spatially-Coupled LDPC Codes on BMS Channels. CoRR abs/1301.6111 (2013) - [i4]Santhosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister:
Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels. CoRR abs/1309.7543 (2013) - 2012
- [c4]Santhosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister:
A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels. Allerton Conference 2012: 176-184 - [i3]Santhosh Kumar, Jean-François Chamberland, Henry D. Pfister:
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory. CoRR abs/1208.3235 (2012) - 2011
- [c1]Santhosh Kumar, Jean-François Chamberland, Henry D. Pfister:
Large deviations on empirical service for erasure channels with memory. Allerton 2011: 1641-1648
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 2024-04-24 22:56 CEST 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:
