default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBadri N. Vellambi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c49]Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi:
Restricted Converse Results for $g$-Group Complete-$\{s\}$ Pliable Index Coding Problems. Allerton 2024: 1-8- [c48]Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi:
Group Complete $-\{s\}$ Pliable Index Coding. ISIT 2024: 1520-1525 - [i24]Sina Eghbal, Badri N. Vellambi, Lawrence Ong
, Parastoo Sadeghi:
Group Complete-s Pliable Index Coding. CoRR abs/2405.07151 (2024) - 2023
- [c47]Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi:
An Improved Greedy Cover Algorithm for Pliable Index Coding. Allerton 2023: 1-8 - [c46]Daniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi:
Preferential Pliable Index Coding. ISIT 2023: 234-239 - [i23]Daniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi:
Preferential Pliable Index Coding. CoRR abs/2305.06577 (2023) - 2022
- [j16]Hong-Yang Lin, Marc Cahay, Badri N. Vellambi, Dennis Morris:
A Generalization of Quaternions and Their Applications. Symmetry 14(3): 599 (2022) - [c45]Lawrence Ong, Badri N. Vellambi:
Very Pliable Index Coding. ISIT 2022: 3244-3249 - [i22]Lawrence Ong, Badri N. Vellambi:
Very Pliable Index Coding. CoRR abs/2205.02614 (2022) - 2021
- [j15]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): 106-120 (2021) - [j14]Michael K. Cohen, Badri N. Vellambi, Marcus Hutter:
Intelligence and Unambitiousness Using Algorithmic Information Theory. IEEE J. Sel. Areas Inf. Theory 2(2): 678-690 (2021) - [j13]Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer:
Strong Coordination Over Noisy Channels. IEEE Trans. Inf. Theory 67(5): 2716-2738 (2021) - [i21]Michael K. Cohen, Badri N. Vellambi, Marcus Hutter:
Intelligence and Unambitiousness Using Algorithmic Information Theory. CoRR abs/2105.06268 (2021) - 2020
- [c44]Michael K. Cohen, Badri N. Vellambi, Marcus Hutter:
Asymptotically Unambitious Artificial General Intelligence. AAAI 2020: 2467-2476 - [c43]Lawrence Ong, Badri N. Vellambi:
Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle. ISIT 2020: 1735-1740
2010 – 2019
- 2019
- [j12]Badri N. Vellambi, Roy Timo:
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. IEEE Trans. Inf. Theory 65(10): 6332-6354 (2019) - [j11]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): 8140-8163 (2019) - [c42]Lawrence Ong, Badri N. Vellambi, Jörg Kliewer:
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. ISIT 2019: 522-526 - [i20]Michael K. Cohen, Badri N. Vellambi, Marcus Hutter:
Asymptotically Unambitious Artificial General Intelligence. CoRR abs/1905.12186 (2019) - [i19]Lawrence Ong, Badri N. Vellambi, Jörg Kliewer:
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. CoRR abs/1909.11847 (2019) - [i18]Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Parastoo Sadeghi:
Improved Lower Bounds for Pliable Index Coding using Absent Receivers. CoRR abs/1909.11850 (2019) - 2018
- [j10]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): 1132-1162 (2018) - [c41]Badri N. Vellambi, Cameron Owen, Marcus Hutter:
Universal Compression of Piecewise i.i.d. Sources. DCC 2018: 267-276 - [c40]Badri N. Vellambi, Jörg Kliewer:
New Results on the Equality of Exact and Wyner Common Information Rates. ISIT 2018: 151-155 - [c39]Badri N. Vellambi, Marcus Hutter:
Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources. ISIT 2018: 731-735 - [c38]Lawrence Ong, Jörg Kliewer, Badri N. Vellambi:
Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage. ISIT 2018: 841-845 - [c37]Yuxin Liu, Badri N. Vellambi, Young-Han Kim, Parastoo Sadeghi:
On the Capacity Region for Secure Index Coding. ITW 2018: 1-5 - [i17]Lawrence Ong, Jörg Kliewer, Badri N. Vellambi, Phee Lep Yeoh:
A Code Equivalence between Secure Network and Index Coding. CoRR abs/1804.09888 (2018) - [i16]Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer:
Strong Coordination over Noisy Channels. CoRR abs/1808.05475 (2018) - [i15]Yuxin Liu, Badri N. Vellambi, Young-Han Kim, Parastoo Sadeghi:
On the Capacity Region for Secure Index Coding. CoRR abs/1809.03615 (2018) - 2017
- [j9]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): 1858-1873 (2017) - [c36]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: 580-587 - [c35]Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer:
Strong coordination over noisy channels: Is separation sufficient? ISIT 2017: 2840-2844 - [i14]Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh:
An Equivalence Between Secure Network and Index Coding. CoRR abs/1702.04803 (2017) - [i13]Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer:
Strong Coordination over Noisy Channels: Is Separation Sufficient? CoRR abs/1704.08771 (2017) - [i12]Sarah A. Obead, Jörg Kliewer, Badri N. Vellambi:
Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes. CoRR abs/1710.03210 (2017) - 2016
- [j8]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): 4057-4069 (2016) - [c34]Badri N. Vellambi, Jörg Kliewer:
Sufficient conditions for the equality of exact and Wyner common information. Allerton 2016: 370-377 - [c33]Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Strong coordination over a line when actions are Markovian. CISS 2016: 412-417 - [c32]Lawrence Ong, Badri N. Vellambi, Jörg Kliewer, Phee Lep Yeoh:
An Equivalence between Secure Network and Index Coding. GLOBECOM Workshops 2016: 1-6 - [c31]Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Lossy compression with near-uniform encoder outputs. ISIT 2016: 530-534 - [c30]Lawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan:
Secure index coding: Existence and construction. ISIT 2016: 2834-2838 - [i11]Lawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan:
Secure Index Coding: Existence and Construction. CoRR abs/1602.01149 (2016) - [i10]Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Lossy Compression with Near-uniform Encoder Outputs. CoRR abs/1602.06902 (2016) - [i9]Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Strong Coordination over Multi-hop Line Networks. CoRR abs/1602.09001 (2016) - [i8]Badri N. Vellambi, Roy Timo:
Common Reconstructions in the Successive Refinement Problem with Receiver Side Information. CoRR abs/1611.05467 (2016) - 2015
- [c29]Nan Zhang, Md. Noor-A-Rahim, Badri N. Vellambi, Khoa D. Nguyen:
Protograph-based anytime reliable channel coding design. ICC 2015: 4048-4053 - [c28]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: 2171-2175 - [c27]Nan Zhang, Md. Noor-A-Rahim, Badri N. Vellambi, Khoa D. Nguyen:
Anytime properties of protograph-based repeat-accumulate codes. ITW Fall 2015: 177-181 - [c26]Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Strong coordination over multi-hop line networks. ITW Fall 2015: 192-196 - [c25]Muhammad Yasir, Siu-Wai Ho, Badri N. Vellambi:
Indoor Position Tracking Using Visible Light. VTC Fall 2015: 1-5 - [i7]Remi A. Chou, Badri N. Vellambi, Matthieu R. Bloch, Jörg Kliewer:
Coding Schemes for Achieving Strong Secrecy at Negligible Cost. CoRR abs/1508.07920 (2015) - 2014
- [j7]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): 1962-1975 (2014) - [c24]Badri N. Vellambi, Roy Timo:
Lossy broadcasting with common transmitter-receiver reconstructions. AusCTW 2014: 138-143 - [c23]Roy Timo, Alex J. Grant, Badri N. Vellambi:
Streaming with autoregressive-hamming distortion for ultra short-delay communications. ISIT 2014: 16-20 - [c22]Badri N. Vellambi, Roy Timo:
Successive refinement with common receiver reconstructions. ISIT 2014: 2664-2668 - [c21]Nan Zhang, Badri N. Vellambi, Khoa D. Nguyen:
Delay exponent of variable-length random binning for point-to-point transmission. ITW 2014: 207-211 - 2013
- [c20]Muhammad Yasir, Siu-Wai Ho, Badri N. Vellambi:
Indoor localization using visible light and accelerometer. GLOBECOM 2013: 3341-3346 - [c19]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: 1864-1868 - [c18]Badri N. Vellambi:
Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable? ISIT 2013: 2164-2168 - [c17]Badri N. Vellambi, Roy Timo:
The Heegard-Berger problem with common receiver reconstructions. ITW 2013: 1-5 - [i6]Ramanan Subramanian, Badri N. Vellambi, Ingmar Land:
Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound. CoRR abs/1301.6255 (2013) - 2012
- [c16]Badri N. Vellambi:
The effect of zero-rate encoders in the multi-terminal source coding problem. ISIT 2012: 756-760 - [c15]Badri N. Vellambi:
Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate region. ITW 2012: 317-321 - [c14]Ingmar Land, Claudio Weidmann, Badri N. Vellambi:
Characterizing the rate region of the coded side-information problem. ITW 2012: 322-326 - 2011
- [j6]Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri:
Throughput and Latency in Finite-Buffer Line Networks. IEEE Trans. Inf. Theory 57(6): 3622-3643 (2011) - [c13]Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri:
Study of throughput and delay in finite-buffer line networks. ITA 2011: 410-414 - [c12]Badri N. Vellambi, Ingmar Land:
Communicating degraded message sets over multi-access channels with degraded encoder state information. ITW 2011: 437-441 - [c11]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: 538-542 - [c10]Ramanan Subramanian, Ingmar Land, Badri N. Vellambi, Lars K. Rasmussen:
Error propagation and the achievable throughput-delay trade-off in wireless networks. ITW 2011: 583-587 - [i5]Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri:
Study of Throughput and Delay in Finite-Buffer Line Networks. CoRR abs/1103.1403 (2011) - [i4]Nima Torabkhani, Badri N. Vellambi, Ahmad Beirami, Faramarz Fekri:
Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks. CoRR abs/1112.2810 (2011) - 2010
- [j5]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): 3561-3572 (2010) - [c9]Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri:
Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime. ITW 2010: 1-5 - [i3]Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri:
Throughput and Latency of Acyclic Erasure Networks with Feedback in a Finite Buffer Regime. CoRR abs/1012.2621 (2010) - [i2]Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri:
Study of Throughput and Latency in Finite-buffer Coded Networks. CoRR abs/1012.2622 (2010) - [i1]Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri:
Throughput and Latency in Finite-Buffer Line Networks. CoRR abs/1012.2628 (2010)
2000 – 2009
- 2009
- [j4]Badri N. Vellambi, Faramarz Fekri:
Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters]. IEEE Trans. Commun. 57(2): 297-301 (2009) - [c8]Roy Timo, Badri N. Vellambi:
Two lossy source coding problems with causal side-information. ISIT 2009: 1040-1044 - [c7]Ramanan Subramanian, Badri N. Vellambi, Faramarz Fekri:
A generalized framework for throughput analysis in sparse mobile networks. WiOpt 2009: 1-10 - 2008
- [b1]Badri N. Vellambi:
Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms. Georgia Institute of Technology, Atlanta, GA, USA, 2008 - [j3]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): 5390-5400 (2008) - [c6]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: 2270-2278 - [c5]Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri:
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. SECON 2008: 551-559 - 2007
- [j2]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): 1510-1520 (2007) - [j1]Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri:
Rateless Codes With Unequal Error Protection Property. IEEE Trans. Inf. Theory 53(4): 1521-1532 (2007) - [c4]Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri:
Efficient broadcasting via rateless coding in multihop wireless networks with local information. IWCMC 2007: 85-90 - [c3]Badri N. Vellambi, Ramanan Subramanian, Faramarz Fekri, Mostafa H. Ammar:
Reliable and efficient message delivery in delay tolerant networks using rateless codes. MobiOpp@MobiSys 2007: 91-98 - 2006
- [c2]Badri N. Vellambi, Faramarz Fekri:
Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes. ISIT 2006: 1129-1133 - 2005
- [c1]Badri N. Vellambi, Faramarz Fekri:
An improved decoding algorithm for low-density parity-check codes over the binary erasure channel. GLOBECOM 2005: 5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
