Badri N. Vellambi

1.2k total citations
51 papers, 834 citations indexed

About

Badri N. Vellambi is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Badri N. Vellambi has authored 51 papers receiving a total of 834 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Electrical and Electronic Engineering, 37 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in Badri N. Vellambi's work include Cooperative Communication and Network Coding (35 papers), Wireless Communication Security Techniques (17 papers) and Error Correcting Code Techniques (10 papers). Badri N. Vellambi is often cited by papers focused on Cooperative Communication and Network Coding (35 papers), Wireless Communication Security Techniques (17 papers) and Error Correcting Code Techniques (10 papers). Badri N. Vellambi collaborates with scholars based in Australia, United States and France. Badri N. Vellambi's co-authors include Faramarz Fekri, Siu‐Wai Ho, Muhammad Yasir, Nazanin Rahnavard, Jörg Kliewer, Robby G. McKilliam, Bill Moran, Barry G. Quinn, I. Vaughan L. Clarkson and Lawrence Ong and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing and IEEE Transactions on Communications.

In The Last Decade

Badri N. Vellambi

49 papers receiving 814 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Badri N. Vellambi Australia 11 660 406 120 112 81 51 834
Arsenia Chorti France 16 791 1.2× 326 0.8× 115 1.0× 27 0.2× 165 2.0× 73 1.0k
Yogesh Nijsure Singapore 14 558 0.8× 259 0.6× 373 3.1× 50 0.4× 82 1.0× 22 919
Luba Tetruashvili Israel 5 462 0.7× 246 0.6× 136 1.1× 23 0.2× 153 1.9× 8 863
Changyong Pan China 16 854 1.3× 327 0.8× 80 0.7× 43 0.4× 30 0.4× 96 977
Julius Kusuma United States 9 343 0.5× 403 1.0× 36 0.3× 36 0.3× 99 1.2× 27 668
Jingyu Hua China 16 561 0.8× 441 1.1× 112 0.9× 47 0.4× 100 1.2× 116 813
G.J.R. Povey United Kingdom 13 705 1.1× 355 0.9× 151 1.3× 66 0.6× 31 0.4× 49 815
Xiaoping Wu China 15 308 0.5× 259 0.6× 105 0.9× 94 0.8× 190 2.3× 123 724
Gustavo Fraidenraich Brazil 21 1.0k 1.6× 611 1.5× 329 2.7× 31 0.3× 64 0.8× 109 1.3k
Ping Deng China 12 293 0.4× 203 0.5× 62 0.5× 197 1.8× 211 2.6× 44 627

Countries citing papers authored by Badri N. Vellambi

Since Specialization
Citations

This map shows the geographic impact of Badri N. Vellambi'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 Badri N. Vellambi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Badri N. Vellambi more than expected).

Fields of papers citing papers by Badri N. Vellambi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Badri N. Vellambi. 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 Badri N. Vellambi. The network helps show where Badri N. Vellambi may publish in the future.

Co-authorship network of co-authors of Badri N. Vellambi

This figure shows the co-authorship network connecting the top 25 collaborators of Badri N. Vellambi. A scholar is included among the top collaborators of Badri N. Vellambi 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 Badri N. Vellambi. Badri N. Vellambi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Vellambi, Badri N., et al.. (2024). Group Complete $-\{s\}$ Pliable Index Coding. 1520–1525.
2.
Vellambi, Badri N., et al.. (2023). An Improved Greedy Cover Algorithm for Pliable Index Coding. 1–8. 1 indexed citations
3.
Cahay, M., et al.. (2022). A Generalization of Quaternions and Their Applications. Symmetry. 14(3). 599–599. 4 indexed citations
4.
Cohen, Michael K., Badri N. Vellambi, & Marcus Hütter. (2021). Intelligence and Unambitiousness Using Algorithmic Information Theory. IEEE Journal on Selected Areas in Information Theory. 2(2). 678–690. 2 indexed citations
5.
Ong, Lawrence, Badri N. Vellambi, Jörg Kliewer, & Phee Lep Yeoh. (2021). A Code and Rate Equivalence Between Secure Network and Index Coding. IEEE Journal on Selected Areas in Information Theory. 2(1). 106–120. 4 indexed citations
6.
Ong, Lawrence, Badri N. Vellambi, & Jörg Kliewer. (2019). Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. arXiv (Cornell University). 522–526. 6 indexed citations
7.
Ong, Lawrence, Jörg Kliewer, & Badri N. Vellambi. (2018). Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage. ANU Open Research (Australian National University). 841–845. 3 indexed citations
8.
Vellambi, Badri N., Jörg Kliewer, & Matthieu R. Bloch. (2017). Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks. IEEE Transactions on Information Theory. 64(2). 1132–1162. 5 indexed citations
9.
Vellambi, Badri N. & Jörg Kliewer. (2016). Sufficient conditions for the equality of exact and Wyner common information. 8 indexed citations
10.
Ong, Lawrence, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, & Jinhong Yuan. (2016). Secure index coding: Existence and construction. arXiv (Cornell University). 2834–2838. 11 indexed citations
11.
Vellambi, Badri N., et al.. (2013). The Heegard-Berger problem with common receiver reconstructions. 8 indexed citations
12.
Yasir, Muhammad, Siu‐Wai Ho, & Badri N. Vellambi. (2013). Indoor localization using visible light and accelerometer. 26 indexed citations
13.
Vellambi, Badri N.. (2012). Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate region. UniSA Research Outputs Repository (University of South Australia). 7. 317–321.
14.
Vellambi, Badri N., et al.. (2010). Study of throughput and latency in finite-buffer coded networks. 1612–1616. 3 indexed citations
15.
Vellambi, Badri N. & Faramarz Fekri. (2009). Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters]. IEEE Transactions on Communications. 57(2). 297–301. 33 indexed citations
16.
Vellambi, Badri N., et al.. (2009). A generalized framework for throughput analysis in sparse mobile networks. 3. 1–10. 9 indexed citations
17.
Rahnavard, Nazanin, Badri N. Vellambi, & Faramarz Fekri. (2008). CRBcast: a reliable and energy-efficient broadcast scheme for wireless sensor networks using rateless codes. IEEE Transactions on Wireless Communications. 7(12). 5390–5400. 14 indexed citations
18.
Vellambi, Badri N., Nazanin Rahnavard, & Faramarz Fekri. (2007). The Effect of Finite Memory on Throughput of Wireline Packet Networks. 60–65. 5 indexed citations
19.
Vellambi, Badri N., et al.. (2007). Reliable and efficient message delivery in delay tolerant networks using rateless codes. 91–98. 25 indexed citations
20.
Vellambi, Badri N., et al.. (2006). Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes. 48. 1129–1133. 3 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