Vishwambhar Rathi

595 total citations
19 papers, 360 citations indexed

About

Vishwambhar Rathi is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Molecular Biology. According to data from OpenAlex, Vishwambhar Rathi has authored 19 papers receiving a total of 360 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computer Networks and Communications, 16 papers in Electrical and Electronic Engineering and 2 papers in Molecular Biology. Recurrent topics in Vishwambhar Rathi's work include Error Correcting Code Techniques (16 papers), Cooperative Communication and Network Coding (15 papers) and Advanced Wireless Communication Techniques (10 papers). Vishwambhar Rathi is often cited by papers focused on Error Correcting Code Techniques (16 papers), Cooperative Communication and Network Coding (15 papers) and Advanced Wireless Communication Techniques (10 papers). Vishwambhar Rathi collaborates with scholars based in Sweden, United States and Switzerland. Vishwambhar Rathi's co-authors include Mikael Skoglund, Mattias Andersson, Ragnar Thobaben, Rüdiger Urbanke, Jörg Kliewer, Iryna Andriyanova, Kapil Bhattad, Lars K. Rasmussen, M Atiqul Haque and Md Wahiduzzaman and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Communications and IEEE Communications Letters.

In The Last Decade

Vishwambhar Rathi

17 papers receiving 322 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Vishwambhar Rathi Sweden 9 331 330 51 48 21 19 360
Xiaopeng Jiao China 10 218 0.7× 194 0.6× 58 1.1× 60 1.3× 25 1.2× 44 259
Matthias Alles Germany 11 362 1.1× 389 1.2× 44 0.9× 17 0.4× 7 0.3× 23 413
Amir Bennatan United States 9 428 1.3× 407 1.2× 51 1.0× 42 0.9× 47 2.2× 15 470
Mohammad Rowshan Australia 10 244 0.7× 212 0.6× 99 1.9× 88 1.8× 8 0.4× 26 281
David Simplot France 8 317 1.0× 121 0.4× 44 0.9× 53 1.1× 63 3.0× 15 391
YouZhe Fan Hong Kong 9 214 0.6× 209 0.6× 78 1.5× 84 1.8× 6 0.3× 15 240
N. Varnica United States 11 287 0.9× 267 0.8× 35 0.7× 54 1.1× 54 2.6× 17 323
Ivana Djurdjevic United States 7 508 1.5× 478 1.4× 72 1.4× 18 0.4× 29 1.4× 12 526
Shumei Song United States 9 377 1.1× 361 1.1× 53 1.0× 35 0.7× 10 0.5× 15 397
Hon-Fah Chong Singapore 6 232 0.7× 307 0.9× 25 0.5× 12 0.3× 30 1.4× 15 317

Countries citing papers authored by Vishwambhar Rathi

Since Specialization
Citations

This map shows the geographic impact of Vishwambhar Rathi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vishwambhar Rathi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vishwambhar Rathi more than expected).

Fields of papers citing papers by Vishwambhar Rathi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vishwambhar Rathi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vishwambhar Rathi. The network helps show where Vishwambhar Rathi may publish in the future.

Co-authorship network of co-authors of Vishwambhar Rathi

This figure shows the co-authorship network connecting the top 25 collaborators of Vishwambhar Rathi. A scholar is included among the top collaborators of Vishwambhar Rathi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Vishwambhar Rathi. Vishwambhar Rathi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Abid, Mohamed Riduan, Md Wahiduzzaman, Vishwambhar Rathi, et al.. (2024). GlueTest: Testing Code Translation via Language Interoperability. 612–617. 1 indexed citations
2.
Rathi, Vishwambhar, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, & Mikael Skoglund. (2012). Performance Analysis and Design of Two Edge-Type LDPC Codes for the BEC Wiretap Channel. IEEE Transactions on Information Theory. 59(2). 1048–1064. 21 indexed citations
3.
Thobaben, Ragnar, et al.. (2012). Polar Codes for Cooperative Relaying. IEEE Transactions on Communications. 60(11). 3263–3273. 51 indexed citations
4.
Rathi, Vishwambhar, Rüdiger Urbanke, Mattias Andersson, & Mikael Skoglund. (2011). Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel. KTH Publication Database DiVA (KTH Royal Institute of Technology). 2393–2397. 33 indexed citations
5.
Rathi, Vishwambhar & Iryna Andriyanova. (2011). Some Results on MAP Decoding of Non-Binary LDPC Codes Over the BEC. IEEE Transactions on Information Theory. 57(4). 2225–2242. 7 indexed citations
6.
Oechtering, Tobias J. & Vishwambhar Rathi. (2010). Coding of streaming sources for the bidirectional broadcast channel.
7.
Andersson, Mattias, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, & Mikael Skoglund. (2010). Equivocation of eve using two edge type LDPC codes for the binary erasure wiretap channel. KTH Publication Database DiVA (KTH Royal Institute of Technology). 5. 2045–2049. 7 indexed citations
8.
Thobaben, Ragnar, et al.. (2010). Polar codes for compress-and-forward in binary relay channels. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1743–1747. 14 indexed citations
9.
Andersson, Mattias, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, & Mikael Skoglund. (2010). Nested Polar Codes for Wiretap and Relay Channels. IEEE Communications Letters. 14(8). 752–754. 113 indexed citations
10.
Rathi, Vishwambhar, et al.. (2010). Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes. 50. 49–58. 2 indexed citations
11.
Rathi, Vishwambhar, et al.. (2010). Optimality of LDGM-LDPC compound codes for lossy compression of binary erasure source. 589–594. 2 indexed citations
12.
Rathi, Vishwambhar, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, & Mikael Skoglund. (2009). Two edge type LDPC codes for the wiretap channel. 834–838. 14 indexed citations
13.
Rathi, Vishwambhar. (2008). Conditional entropy of non-binary LDPC codes over the BEC. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 945–949. 14 indexed citations
14.
Rathi, Vishwambhar. (2008). Non-binary LDPC codes and EXIT like functions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 9 indexed citations
15.
Bhattad, Kapil, Vishwambhar Rathi, & Rüdiger Urbanke. (2007). Degree Optimization and Stability Condition for the Min-Sum Decoder. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 50. 190–195. 2 indexed citations
16.
Rathi, Vishwambhar & Rüdiger Urbanke. (2007). Existence Proofs of Some EXIT Like Functions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 866–870. 2 indexed citations
17.
Rathi, Vishwambhar. (2005). On the asymptotic weight distribution of regular LDPC ensembles. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2161–2165. 8 indexed citations
18.
Rathi, Vishwambhar & Rüdiger Urbanke. (2005). Density evolution, thresholds and the stability condition for non-binary LDPC codes. IEE Proceedings - Communications. 152(6). 1069–1069. 59 indexed citations
19.
Rathi, Vishwambhar, et al.. (2000). Genotype × environment interaction and stability parameters in chickpea.. 14(1). 32–35. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026