Badri N. Vellambi

93 papers A* 2B 35Misc 2Journal 42Unranked 11

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

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.