An improved decoding algorithm for low-density parity-check codes over the binary erasure channel. - Badri N. Vellambi; Faramarz Fekri (GLOBECOM, 2005)

Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes. - Badri N. Vellambi; Faramarz Fekri (ISIT, 2006)

Efficient broadcasting via rateless coding in multihop wireless networks with local information. - Nazanin Rahnavard; Badri N. Vellambi; Faramarz Fekri (IWCMC, 2007)

Reliable and efficient message delivery in delay tolerant networks using rateless codes. - Badri N. Vellambi; Ramanan Subramanian; Faramarz Fekri; Mostafa H. Ammar (MobiOpp@MobiSys, 2007)

Rateless Codes With Unequal Error Protection Property. - Nazanin Rahnavard; Badri N. Vellambi; Faramarz Fekri (IEEE Trans. Inf. Theory, 2007)

Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel. - Badri N. Vellambi; Faramarz Fekri (IEEE Trans. Inf. Theory, 2007)

DSCM: An Energy-Efficient and Rate-Optimal Multicast Protocol for Multihop Wireless Networks Using Distributed Source Coding. - Mina Sartipi; Badri N. Vellambi; Nazanin Rahnavard; Faramarz Fekri (INFOCOM, 2008)

Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. - Nazanin Rahnavard; Badri N. Vellambi; Faramarz Fekri (SECON, 2008)

CRBcast: a reliable and energy-efficient broadcast scheme for wireless sensor networks using rateless codes. - Nazanin Rahnavard; Badri N. Vellambi; Faramarz Fekri (IEEE Trans. Wirel. Commun., 2008)

Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms. - Badri N. Vellambi (2008)

Two lossy source coding problems with causal side-information. - Roy Timo; Badri N. Vellambi (ISIT, 2009)

A generalized framework for throughput analysis in sparse mobile networks. - Ramanan Subramanian; Badri N. Vellambi; Faramarz Fekri (WiOpt, 2009)

Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters]. - Badri N. Vellambi; Faramarz Fekri (IEEE Trans. Commun., 2009)

Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime. - Nima Torabkhani; Badri N. Vellambi; Faramarz Fekri (ITW, 2010)

Study of Throughput and Latency in Finite-buffer Coded Networks - Nima Torabkhani; Badri N. Vellambi; Faramarz Fekri (CoRR, 2010)

FTS: A Distributed Energy-Efficient Broadcasting Scheme Using Fountain Codes for Multihop Wireless Networks. - Badri N. Vellambi; Nazanin Rahnavard; Faramarz Fekri (IEEE Trans. Commun., 2010)

Study of throughput and delay in finite-buffer line networks. - Badri N. Vellambi; Nima Torabkhani; Faramarz Fekri (ITA, 2011)

Error propagation and the achievable throughput-delay trade-off in wireless networks. - Ramanan Subramanian; Ingmar Land; Badri N. Vellambi; Lars K. Rasmussen (ITW, 2011)

Exact modeling of the performance of random linear network coding in finite-buffer networks. - Nima Torabkhani; Badri N. Vellambi; Ahmad Beirami; Faramarz Fekri (ITW, 2011)

Communicating degraded message sets over multi-access channels with degraded encoder state information. - Badri N. Vellambi; Ingmar Land (ITW, 2011)

Throughput and Latency in Finite-Buffer Line Networks. - Badri N. Vellambi; Nima Torabkhani; Faramarz Fekri (IEEE Trans. Inf. Theory, 2011)

The effect of zero-rate encoders in the multi-terminal source coding problem. - Badri N. Vellambi (ISIT, 2012)

Characterizing the rate region of the coded side-information problem. - Ingmar Land; Claudio Weidmann; Badri N. Vellambi (ITW, 2012)

Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate region. - Badri N. Vellambi (ITW, 2012)

Indoor localization using visible light and accelerometer. - Muhammad Yasir; Siu-Wai Ho; Badri N. Vellambi (GLOBECOM, 2013)

An improved bound on information loss due to finite block length in a Gaussian line network. - Ramanan Subramanian; Badri N. Vellambi; Ingmar Land (ISIT, 2013)

Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable? - Badri N. Vellambi (ISIT, 2013)

The Heegard-Berger problem with common receiver reconstructions. - Badri N. Vellambi; Roy Timo (ITW, 2013)

Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound - Ramanan Subramanian; Badri N. Vellambi; Ingmar Land (CoRR, 2013)

Lossy broadcasting with common transmitter-receiver reconstructions. - Badri N. Vellambi; Roy Timo (AusCTW, 2014)

Streaming with autoregressive-hamming distortion for ultra short-delay communications. - Roy Timo; Alex J. Grant; Badri N. Vellambi (ISIT, 2014)

Successive refinement with common receiver reconstructions. - Badri N. Vellambi; Roy Timo (ISIT, 2014)

Delay exponent of variable-length random binning for point-to-point transmission. - Nan Zhang; Badri N. Vellambi; Khoa D. Nguyen (ITW, 2014)

Polynomial Phase Estimation by Least Squares Phase Unwrapping. - Robby G. McKilliam; Barry G. Quinn; I. Vaughan L. Clarkson; William Moran 001; Badri N. Vellambi (IEEE Trans. Signal Process., 2014)

Protograph-based anytime reliable channel coding design. - Nan Zhang; Md. Noor-A-Rahim; Badri N. Vellambi; Khoa D. Nguyen (ICC, 2015)

Lossless and lossy source compression with near-uniform output: Is common randomness always required? - Badri N. Vellambi; Matthieu R. Bloch; Remi A. Chou; Jörg Kliewer (ISIT, 2015)

Strong coordination over multi-hop line networks. - Badri N. Vellambi; Jörg Kliewer; Matthieu R. Bloch (ITW Fall, 2015)

Anytime properties of protograph-based repeat-accumulate codes. - Nan Zhang; Md. Noor-A-Rahim; Badri N. Vellambi; Khoa D. Nguyen (ITW Fall, 2015)

Indoor Position Tracking Using Visible Light. - Muhammad Yasir; Siu-Wai Ho; Badri N. Vellambi (VTC Fall, 2015)

Sufficient conditions for the equality of exact and Wyner common information. - Badri N. Vellambi; Jörg Kliewer (Allerton, 2016)

Strong coordination over a line when actions are Markovian. - Badri N. Vellambi; Jörg Kliewer; Matthieu R. Bloch (CISS, 2016)

An Equivalence between Secure Network and Index Coding. - Lawrence Ong; Badri N. Vellambi; Jörg Kliewer; Phee Lep Yeoh (GLOBECOM Workshops, 2016)

Secure index coding: Existence and construction. - Lawrence Ong; Badri N. Vellambi; Phee Lep Yeoh; Jörg Kliewer; Jinhong Yuan (ISIT, 2016)

Lossy compression with near-uniform encoder outputs. - Badri N. Vellambi; Jörg Kliewer; Matthieu R. Bloch (ISIT, 2016)

Anytime Characteristics of Protograph-Based LDPC Convolutional Codes. - Nan Zhang; Md. Noor-A-Rahim; Badri N. Vellambi; Khoa D. Nguyen (IEEE Trans. Commun., 2016)

Joint coordination-channel coding for strong coordination over noisy channels based on polar codes. - Sarah A. Obead; Jörg Kliewer; Badri N. Vellambi (Allerton, 2017)

Strong coordination over noisy channels: Is separation sufficient? - Sarah A. Obead; Badri N. Vellambi; Jörg Kliewer (ISIT, 2017)

Coding Schemes for Achieving Strong Secrecy at Negligible Cost. - Remi A. Chou; Badri N. Vellambi; Matthieu R. Bloch; Jörg Kliewer (IEEE Trans. Inf. Theory, 2017)

Universal Compression of Piecewise i.i.d. Sources. - Badri N. Vellambi; Cameron Owen; Marcus Hutter (DCC, 2018)

Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage. - Lawrence Ong; Jörg Kliewer; Badri N. Vellambi (ISIT, 2018)

Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources. - Badri N. Vellambi; Marcus Hutter (ISIT, 2018)

New Results on the Equality of Exact and Wyner Common Information Rates. - Badri N. Vellambi; Jörg Kliewer (ISIT, 2018)

On the Capacity Region for Secure Index Coding. - Yuxin Liu; Badri N. Vellambi; Young-Han Kim 001; Parastoo Sadeghi (ITW, 2018)

A Code Equivalence between Secure Network and Index Coding. - Lawrence Ong; Jörg Kliewer; Badri N. Vellambi; Phee Lep Yeoh (CoRR, 2018)

Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks. - Badri N. Vellambi; Jörg Kliewer; Matthieu R. Bloch (IEEE Trans. Inf. Theory, 2018)

Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. - Lawrence Ong; Badri N. Vellambi; Jörg Kliewer (ISIT, 2019)

Improved Lower Bounds for Pliable Index Coding using Absent Receivers. - Lawrence Ong; Badri N. Vellambi; Jörg Kliewer; Parastoo Sadeghi (CoRR, 2019)

Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels. - Roy Timo; Badri N. Vellambi; Alex J. Grant; Khoa D. Nguyen (IEEE Trans. Inf. Theory, 2019)

Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. - Badri N. Vellambi; Roy Timo (IEEE Trans. Inf. Theory, 2019)

Asymptotically Unambitious Artificial General Intelligence. - Michael K. Cohen; Badri N. Vellambi; Marcus Hutter (AAAI, 2020)

Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle. - Lawrence Ong; Badri N. Vellambi (ISIT, 2020)

Intelligence and Unambitiousness Using Algorithmic Information Theory. - Michael K. Cohen; Badri N. Vellambi; Marcus Hutter (IEEE J. Sel. Areas Inf. Theory, 2021)

A Code and Rate Equivalence Between Secure Network and Index Coding. - Lawrence Ong; Badri N. Vellambi; Jörg Kliewer; Phee Lep Yeoh (IEEE J. Sel. Areas Inf. Theory, 2021)

Strong Coordination Over Noisy Channels. - Sarah A. Obead; Badri N. Vellambi; Jörg Kliewer (IEEE Trans. Inf. Theory, 2021)

Very Pliable Index Coding. - Lawrence Ong; Badri N. Vellambi (ISIT, 2022)

A Generalization of Quaternions and Their Applications. - Hong-Yang Lin; Marc Cahay; Badri N. Vellambi; Dennis Morris (Symmetry, 2022)

An Improved Greedy Cover Algorithm for Pliable Index Coding. - Sina Eghbal; Badri N. Vellambi; Lawrence Ong; Parastoo Sadeghi (Allerton, 2023)

Preferential Pliable Index Coding. - Daniel Byrne; Lawrence Ong; Parastoo Sadeghi; Badri N. Vellambi (ISIT, 2023)

Restricted Converse Results for $g$-Group Complete-$ {s }$ Pliable Index Coding Problems. - Sina Eghbal; Badri N. Vellambi; Lawrence Ong; Parastoo Sadeghi (Allerton, 2024)

Group Complete $- {s }$ Pliable Index Coding. - Sina Eghbal; Badri N. Vellambi; Lawrence Ong; Parastoo Sadeghi (ISIT, 2024)