Badri N. Vellambi

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Strong Coordination Over Noisy Channels.

[BibT_eX]

[DOI]

Sarah A. Obead

IEEE Trans. Inf. Theory, 2021

A Code and Rate Equivalence Between Secure Network and Index Coding.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Intelligence and Unambitiousness Using Algorithmic Information Theory.

[BibT_eX]

[DOI]

Michael K. Cohen

IEEE J. Sel. Areas Inf. Theory, 2021

2020

Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Asymptotically Unambitious Artificial General Intelligence.

[BibT_eX]

[DOI]

Michael K. Cohen

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Common Reconstructions in the Successive Refinement Problem With Receiver Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Improved Lower Bounds for Pliable Index Coding using Absent Receivers.

[BibT_eX]

[DOI]

CoRR, 2019

Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

A Code Equivalence between Secure Network and Index Coding.

[BibT_eX]

[DOI]

CoRR, 2018

On the Capacity Region for Secure Index Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

New Results on the Equality of Exact and Wyner Common Information Rates.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Universal Compression of Piecewise i.i.d. Sources.

[BibT_eX]

[DOI]

Cameron Owen

Proceedings of the 2018 Data Compression Conference, 2018

2017

Coding Schemes for Achieving Strong Secrecy at Negligible Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Strong coordination over noisy channels: Is separation sufficient?

[BibT_eX]

[DOI]

Sarah A. Obead

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Joint coordination-channel coding for strong coordination over noisy channels based on polar codes.

[BibT_eX]

[DOI]

Sarah A. Obead

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Anytime Characteristics of Protograph-Based LDPC Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2016

Lossy compression with near-uniform encoder outputs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Secure index coding: Existence and construction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

An Equivalence between Secure Network and Index Coding.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

Strong coordination over a line when actions are Markovian.

[BibT_eX]

[DOI]

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

Sufficient conditions for the equality of exact and Wyner common information.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Indoor Position Tracking Using Visible Light.

[BibT_eX]

[DOI]

Muhammad Yasir

Siu-Wai Ho

Proceedings of the IEEE 82nd Vehicular Technology Conference, 2015

Anytime properties of protograph-based repeat-accumulate codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Strong coordination over multi-hop line networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Lossless and lossy source compression with near-uniform output: Is common randomness always required?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Protograph-based anytime reliable channel coding design.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

Polynomial Phase Estimation by Least Squares Phase Unwrapping.

[BibT_eX]

[DOI]

Robby G. McKilliam

Barry G. Quinn

I. Vaughan L. Clarkson

William Moran

IEEE Trans. Signal Process., 2014

Delay exponent of variable-length random binning for point-to-point transmission.

[BibT_eX]

[DOI]

Nan Zhang

Khoa D. Nguyen

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Successive refinement with common receiver reconstructions.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Streaming with autoregressive-hamming distortion for ultra short-delay communications.

[BibT_eX]

[DOI]

Alex J. Grant

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Lossy broadcasting with common transmitter-receiver reconstructions.

[BibT_eX]

[DOI]

Proceedings of the Australian Communications Theory Workshop, AusCTW 2014, Sydney, 2014

2013

Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound

[BibT_eX]

[DOI]

Ramanan Subramanian

CoRR, 2013

The Heegard-Berger problem with common receiver reconstructions.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable?

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

An improved bound on information loss due to finite block length in a Gaussian line network.

[BibT_eX]

[DOI]

Ramanan Subramanian

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Indoor localization using visible light and accelerometer.

[BibT_eX]

[DOI]

Muhammad Yasir

Siu-Wai Ho

Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012

Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate region.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Characterizing the rate region of the coded side-information problem.

[BibT_eX]

[DOI]

Claudio Weidmann

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The effect of zero-rate encoders in the multi-terminal source coding problem.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Throughput and Latency in Finite-Buffer Line Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Communicating degraded message sets over multi-access channels with degraded encoder state information.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Exact modeling of the performance of random linear network coding in finite-buffer networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Error propagation and the achievable throughput-delay trade-off in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Study of throughput and delay in finite-buffer line networks.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

2010

FTS: A Distributed Energy-Efficient Broadcasting Scheme Using Fountain Codes for Multihop Wireless Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2010

Study of Throughput and Latency in Finite-buffer Coded Networks

[BibT_eX]

[DOI]

CoRR, 2010

Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009

Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters].

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2009

A generalized framework for throughput analysis in sparse mobile networks.

[BibT_eX]

[DOI]

Ramanan Subramanian

Proceedings of the 7th International Symposium on Modeling and Optimization in Mobile, 2009

Two lossy source coding problems with causal side-information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2008

CRBcast: a reliable and energy-efficient broadcast scheme for wireless sensor networks using rateless codes.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2008

Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

DSCM: An Energy-Efficient and Rate-Optimal Multicast Protocol for Multihop Wireless Networks Using Distributed Source Coding.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Rateless Codes With Unequal Error Protection Property.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Reliable and efficient message delivery in delay tolerant networks using rateless codes.

[BibT_eX]

[DOI]

Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking, 2007

Efficient broadcasting via rateless coding in multihop wireless networks with local information.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2007

2006

Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

An improved decoding algorithm for low-density parity-check codes over the binary erasure channel.

[BibT_eX]

[DOI]