default search action
Vishwambhar Rathi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
- [j4]Vishwambhar Rathi, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Performance Analysis and Design of Two Edge-Type LDPC Codes for the BEC Wiretap Channel. IEEE Trans. Inf. Theory 59(2): 1048-1064 (2013) - 2012
- [j3]Ricardo Blasco-Serrano, Ragnar Thobaben, Mattias Andersson, Vishwambhar Rathi, Mikael Skoglund:
Polar Codes for Cooperative Relaying. IEEE Trans. Commun. 60(11): 3263-3273 (2012) - 2011
- [j2]Vishwambhar Rathi, Iryna Andriyanova:
Some Results on MAP Decoding of Non-Binary LDPC Codes Over the BEC. IEEE Trans. Inf. Theory 57(4): 2225-2242 (2011) - 2010
- [j1]Mattias Andersson, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Nested Polar Codes for Wiretap and Relay Channels. IEEE Commun. Lett. 14(8): 752-754 (2010)
Conference and Workshop Papers
- 2011
- [c8]Vishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund:
Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel. ISIT 2011: 2393-2397 - 2010
- [c7]Grégory Demay, Vishwambhar Rathi, Lars K. Rasmussen:
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes. DCC 2010: 49-58 - [c6]Grégory Demay, Vishwambhar Rathi, Lars K. Rasmussen:
Optimality of LDGM-LDPC compound codes for lossy compression of binary erasure source. ISITA 2010: 589-594 - [c5]Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund:
Bounds on Threshold of Regular Random k-SAT. SAT 2010: 264-277 - 2009
- [c4]Iryna Andriyanova, Vishwambhar Rathi, Vishwambhar Tillich:
Binary weight distribution of non-binary LDPC codes. ISIT 2009: 65-69 - 2008
- [c3]Vishwambhar Rathi:
Conditional entropy of non-binary LDPC codes over the BEC. ISIT 2008: 945-949 - 2007
- [c2]Vishwambhar Rathi, Rüdiger L. Urbanke:
Existence Proofs of Some EXIT Like Functions. ISIT 2007: 866-870 - 2005
- [c1]Vishwambhar Rathi:
On the asymptotic weight distribution of regular LDPC ensembles. ISIT 2005: 2161-2165
Informal and Other Publications
- 2010
- [i9]Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund:
Bounds on Threshold of Regular Random $k$-SAT. CoRR abs/1002.1290 (2010) - [i8]Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund:
Bounds on Thresholds Related to Maximum Satisfiability of Regular Random Formulas. CoRR abs/1004.2425 (2010) - [i7]Mattias Andersson, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Nested Polar Codes for Wiretap and Relay Channels. CoRR abs/1006.3573 (2010) - [i6]Vishwambhar Rathi, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Performance Analysis and Design of Two Edge Type LDPC Codes for the BEC Wiretap Channel. CoRR abs/1009.4610 (2010) - [i5]Vishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund:
Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel. CoRR abs/1010.1669 (2010) - 2007
- [i4]Vishwambhar Rathi, Rüdiger L. Urbanke:
Existence Proofs of Some EXIT Like Functions. CoRR abs/0704.2544 (2007) - [i3]Kapil Bhattad, Vishwambhar Rathi, Rüdiger L. Urbanke:
Degree Optimization and Stability Condition for the Min-Sum Decoder. CoRR abs/0705.1345 (2007) - 2005
- [i2]Vishwambhar Rathi, Rüdiger L. Urbanke:
Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes. CoRR abs/cs/0511100 (2005) - [i1]Vishwambhar Rathi:
On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles. CoRR abs/cs/0512066 (2005)
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 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint