Venkat Chandar

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Data Compression with Private Local Decodability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Local Decoding in Distributed Compression.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

Random Access in Distributed Source Coding.

[BibT_eX]

[DOI]

CoRR, 2022

Locally Decodable Slepian-Wolf Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2020

O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2018

Sampling Constrained Asynchronous Communication: How to Sleep Efficiently.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

2015

Iris Biometric Security Challenges and Possible Solutions: For your eyes only?Using the iris as a key.

[BibT_eX]

[DOI]

IEEE Signal Process. Mag., 2015

Quickest Transient-Change Detection under a Sampling Constraint.

[BibT_eX]

[DOI]

CoRR, 2015

Local recovery in data compression for general sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Asynchronous capacity per unit cost under a receiver sampling constraint.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Energy and Sampling Constrained Asynchronous Communication.

[BibT_eX]

[DOI]

Giuseppe Caire

IEEE Trans. Inf. Theory, 2014

Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

2013

Asynchronous Communication: Capacity Bounds and Suboptimality of Training.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Asynchronous Capacity per Unit Cost.

[BibT_eX]

[DOI]

David Tse

IEEE Trans. Inf. Theory, 2013

Local recovery properties of capacity achieving codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Low-density random matrices for secret key extraction.

[BibT_eX]

[DOI]

Hongchao Zhou

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

2012

On reliability functions for single-message unequal error protection.

[BibT_eX]

[DOI]

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

Update efficient codes for error correction.

[BibT_eX]

[DOI]

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

2011

On Bounded Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Error exponents in asynchronous communication.

[BibT_eX]

[DOI]

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

2010

Sparse graph codes for compression, sensing, and secrecy.

[BibT_eX]

[DOI]

PhD thesis, 2010

A simple message-passing algorithm for compressed sensing.

[BibT_eX]

[DOI]

Devavrat Shah

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Communication under strong asynchronism.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Training-Based Schemes are Suboptimal for High Rate Asynchronous Communication

[BibT_eX]

[DOI]

CoRR, 2009

A locally encodable and decodable compressed data structure.

[BibT_eX]

[DOI]

Devavrat Shah

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Optimal Sequential Frame Synchronization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the capacity region of asynchronous channels.

[BibT_eX]

[DOI]

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

2006

Information Embedding Codes on Graphs with Iterative Encoding and Decoding.

[BibT_eX]

[DOI]

Emin Martinian