Badri N. Vellambi

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 50

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

Allerton

Georgia Institute of Technology, Atlanta, GA, USA (PHD)

Education History

Georgia Institute of Technology, Atlanta, GA, USA

PHD

Publications

Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi
Group Complete-s Pliable Index Coding. CoRR (2024)
Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi
An Improved Greedy Cover Algorithm for Pliable Index Coding. Allerton (2023)
Daniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi
Preferential Pliable Index Coding. CoRR (2023)
Daniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi
Preferential Pliable Index Coding. ISIT (2023)
Lawrence Ong, Badri N. Vellambi
Very Pliable Index Coding. CoRR (2022)
Lawrence Ong, Badri N. Vellambi
Very Pliable Index Coding. ISIT (2022)
Hong-Yang Lin, Marc Cahay, Badri N. Vellambi, Dennis Morris
A Generalization of Quaternions and Their Applications. Symmetry 14 (3) (2022)
Michael K. Cohen, Badri N. Vellambi, Marcus Hutter
Intelligence and Unambitiousness Using Algorithmic Information Theory. IEEE J. Sel. Areas Inf. Theory 2 (2) (2021)
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
Strong Coordination Over Noisy Channels. IEEE Trans. Inf. Theory 67 (5) (2021)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh
A Code and Rate Equivalence Between Secure Network and Index Coding. IEEE J. Sel. Areas Inf. Theory 2 (1) (2021)
Michael K. Cohen, Badri N. Vellambi, Marcus Hutter
Intelligence and Unambitiousness Using Algorithmic Information Theory. CoRR (2021)
Lawrence Ong, Badri N. Vellambi
Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle. ISIT (2020)
Michael K. Cohen, Badri N. Vellambi, Marcus Hutter
Asymptotically Unambitious Artificial General Intelligence. AAAI (2020)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. CoRR (2019)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. ISIT (2019)
Badri N. Vellambi, Roy Timo
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. IEEE Trans. Inf. Theory 65 (10) (2019)
Roy Timo, Badri N. Vellambi, Alex J. Grant, Khoa D. Nguyen
Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels. IEEE Trans. Inf. Theory 65 (12) (2019)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Parastoo Sadeghi
Improved Lower Bounds for Pliable Index Coding using Absent Receivers. CoRR (2019)
Michael K. Cohen, Badri N. Vellambi, Marcus Hutter
Asymptotically Unambitious Artificial General Intelligence. CoRR (2019)
Yuxin Liu, Badri N. Vellambi, Young-Han Kim, Parastoo Sadeghi
On the Capacity Region for Secure Index Coding. ITW (2018)
Yuxin Liu, Badri N. Vellambi, Young-Han Kim, Parastoo Sadeghi
On the Capacity Region for Secure Index Coding. CoRR (2018)
Badri N. Vellambi, Cameron Owen, Marcus Hutter
Universal Compression of Piecewise i.i.d. Sources. DCC (2018)
Badri N. Vellambi, Marcus Hutter
Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources. ISIT (2018)
Lawrence Ong, Jörg Kliewer, Badri N. Vellambi
Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage. ISIT (2018)
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
Strong Coordination over Noisy Channels. CoRR (2018)
Badri N. Vellambi, Jörg Kliewer
New Results on the Equality of Exact and Wyner Common Information Rates. ISIT (2018)
Lawrence Ong, Jörg Kliewer, Badri N. Vellambi, Phee Lep Yeoh
A Code Equivalence between Secure Network and Index Coding. CoRR (2018)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks. IEEE Trans. Inf. Theory 64 (2) (2018)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh
An Equivalence Between Secure Network and Index Coding. CoRR (2017)
Remi A. Chou, Badri N. Vellambi, Matthieu R. Bloch, Jörg Kliewer
Coding Schemes for Achieving Strong Secrecy at Negligible Cost. IEEE Trans. Inf. Theory 63 (3) (2017)
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
Strong Coordination over Noisy Channels: Is Separation Sufficient? CoRR (2017)
Sarah A. Obead, Jörg Kliewer, Badri N. Vellambi
Joint coordination-channel coding for strong coordination over noisy channels based on polar codes. Allerton (2017)
Sarah A. Obead, Jörg Kliewer, Badri N. Vellambi
Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes. CoRR (2017)
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
Strong coordination over noisy channels: Is separation sufficient? ISIT (2017)
Nan Zhang, Md. Noor-A.-Rahim, Badri N. Vellambi, Khoa D. Nguyen
Anytime Characteristics of Protograph-Based LDPC Convolutional Codes. IEEE Trans. Commun. 64 (10) (2016)
Lawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan
Secure Index Coding: Existence and Construction. CoRR (2016)
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh
An Equivalence between Secure Network and Index Coding. GLOBECOM Workshops (2016)
Badri N. Vellambi, Jörg Kliewer
Sufficient conditions for the equality of exact and Wyner common information. Allerton (2016)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Lossy Compression with Near-uniform Encoder Outputs. CoRR (2016)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Strong Coordination over Multi-hop Line Networks. CoRR (2016)
Badri N. Vellambi, Roy Timo
Common Reconstructions in the Successive Refinement Problem with Receiver Side Information. CoRR (2016)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Lossy compression with near-uniform encoder outputs. ISIT (2016)
Lawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan
Secure index coding: Existence and construction. ISIT (2016)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Strong coordination over a line when actions are Markovian. CISS (2016)
Nan Zhang, Md. Noor-A.-Rahim, Badri N. Vellambi, Khoa D. Nguyen
Protograph-based anytime reliable channel coding design. ICC (2015)
Muhammad Yasir, Siu-Wai Ho, Badri N. Vellambi
Indoor Position Tracking Using Visible Light. VTC Fall (2015)
Nan Zhang, Md. Noor-A.-Rahim, Badri N. Vellambi, Khoa D. Nguyen
Anytime properties of protograph-based repeat-accumulate codes. ITW Fall (2015)
Badri N. Vellambi, Matthieu R. Bloch, Remi A. Chou, Jörg Kliewer
Lossless and lossy source compression with near-uniform output: Is common randomness always required? ISIT (2015)
Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch
Strong coordination over multi-hop line networks. ITW Fall (2015)
Remi A. Chou, Badri N. Vellambi, Matthieu R. Bloch, Jörg Kliewer
Coding Schemes for Achieving Strong Secrecy at Negligible Cost. CoRR (2015)
Roy Timo, Alex J. Grant, Badri N. Vellambi
Streaming with autoregressive-hamming distortion for ultra short-delay communications. ISIT (2014)
Nan Zhang, Badri N. Vellambi, Khoa D. Nguyen
Delay exponent of variable-length random binning for point-to-point transmission. ITW (2014)
Badri N. Vellambi, Roy Timo
Lossy broadcasting with common transmitter-receiver reconstructions. AusCTW (2014)
Robby G. McKilliam, Barry G. Quinn, I. Vaughan L. Clarkson, William Moran, Badri N. Vellambi
Polynomial Phase Estimation by Least Squares Phase Unwrapping. IEEE Trans. Signal Process. 62 (8) (2014)
Badri N. Vellambi, Roy Timo
Successive refinement with common receiver reconstructions. ISIT (2014)
Muhammad Yasir, Siu-Wai Ho, Badri N. Vellambi
Indoor localization using visible light and accelerometer. GLOBECOM (2013)
Badri N. Vellambi
Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable? ISIT (2013)
Ramanan Subramanian, Badri N. Vellambi, Ingmar Land
An improved bound on information loss due to finite block length in a Gaussian line network. ISIT (2013)
Ramanan Subramanian, Badri N. Vellambi, Ingmar Land
Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound CoRR (2013)
Badri N. Vellambi, Roy Timo
The Heegard-Berger problem with common receiver reconstructions. ITW (2013)
Ingmar Land, Claudio Weidmann, Badri N. Vellambi
Characterizing the rate region of the coded side-information problem. ITW (2012)
Badri N. Vellambi
The effect of zero-rate encoders in the multi-terminal source coding problem. ISIT (2012)
Badri N. Vellambi
Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate region. ITW (2012)
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
Throughput and Latency in Finite-Buffer Line Networks. IEEE Trans. Inf. Theory 57 (6) (2011)
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
Study of throughput and delay in finite-buffer line networks. ITA (2011)
Nima Torabkhani, Badri N. Vellambi, Ahmad Beirami, Faramarz Fekri
Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks CoRR (2011)
Nima Torabkhani, Badri N. Vellambi, Ahmad Beirami, Faramarz Fekri
Exact modeling of the performance of random linear network coding in finite-buffer networks. ITW (2011)
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
Study of Throughput and Delay in Finite-Buffer Line Networks CoRR (2011)
Ramanan Subramanian, Ingmar Land, Badri N. Vellambi, Lars K. Rasmussen
Error propagation and the achievable throughput-delay trade-off in wireless networks. ITW (2011)
Badri N. Vellambi, Ingmar Land
Communicating degraded message sets over multi-access channels with degraded encoder state information. ITW (2011)
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
Throughput and Latency in Finite-Buffer Line Networks CoRR (2010)
Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri
Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime. ITW (2010)
Badri N. Vellambi, Nazanin Rahnavard, Faramarz Fekri
FTS: A Distributed Energy-Efficient Broadcasting Scheme Using Fountain Codes for Multihop Wireless Networks. IEEE Trans. Commun. 58 (12) (2010)
Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri
Throughput and Latency of Acyclic Erasure Networks with Feedback in a Finite Buffer Regime CoRR (2010)
Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri
Study of Throughput and Latency in Finite-buffer Coded Networks CoRR (2010)
Badri N. Vellambi, Faramarz Fekri
Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters]. IEEE Trans. Commun. 57 (2) (2009)
Roy Timo, Badri N. Vellambi
Two lossy source coding problems with causal side-information. ISIT (2009)
Ramanan Subramanian, Badri N. Vellambi, Faramarz Fekri
A generalized framework for throughput analysis in sparse mobile networks. WiOpt (2009)
Mina Sartipi, Badri N. Vellambi, Nazanin Rahnavard, Faramarz Fekri
DSCM: An Energy-Efficient and Rate-Optimal Multicast Protocol for Multihop Wireless Networks Using Distributed Source Coding. INFOCOM (2008)
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. SECON (2008)
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri
CRBcast: a reliable and energy-efficient broadcast scheme for wireless sensor networks using rateless codes. IEEE Trans. Wirel. Commun. 7 (12-2) (2008)
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri
Efficient broadcasting via rateless coding in multihop wireless networks with local information. IWCMC (2007)
Badri N. Vellambi, Ramanan Subramanian, Faramarz Fekri, Mostafa Ammar
Reliable and efficient message delivery in delay tolerant networks using rateless codes. MobiOpp@MobiSys (2007)
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri
Rateless Codes With Unequal Error Protection Property. IEEE Trans. Inf. Theory 53 (4) (2007)
Badri N. Vellambi, Faramarz Fekri
Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel. IEEE Trans. Inf. Theory 53 (4) (2007)
Badri N. Vellambi, Faramarz Fekri
Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes. ISIT (2006)
Badri N. Vellambi, Faramarz Fekri
An improved decoding algorithm for low-density parity-check codes over the binary erasure channel. GLOBECOM (2005)

Badri N. Vellambi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Badri N. Vellambi