Shashank Vatedka

IEEE Trans. Inf. Theory, February, 2024

2023

Multiple Packing:Lower Bounds via Infinite Constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

Communication-Constrained Distributed Mean Estimation of Log-Concave Distributions.

[BibT_eX]

[DOI]

Ritesh Kumar

Proceedings of the 28th National Conference on Communications, 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

Quadratically Constrained Myopic Adversarial Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

List Decoding Random Euclidean Codes and Infinite Constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Multiple Packing: Lower Bounds via Infinite Constellations.

[BibT_eX]

[DOI]

CoRR, 2022

Multiple Packing: Lower and Upper Bounds.

[BibT_eX]

[DOI]

CoRR, 2022

Random Access in Distributed Source Coding.

[BibT_eX]

[DOI]

CoRR, 2022

Low-Complexity Compression with Random Access.

[BibT_eX]

[DOI]

Srikanth Kamparaju

Shaik Mastan

Proceedings of the IEEE International Conference on Signal Processing and Communications, 2022

Lower bounds for Multiple Packing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

List-Decodability of Poisson Point Processes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Lower Bounds on List Decoding Capacity using Error Exponents.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Locally Decodable Slepian-Wolf Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2020

Local Decode and Update for Big Data Compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Modified Bethe Permanent of a Nonnegative Matrix.

[BibT_eX]

[DOI]

Pascal O. Vontobel

Proceedings of the International Conference on Signal Processing and Communications, 2020

Quadratically Constrained Two-way Adversarial Channels.

[BibT_eX]

[DOI]

Sidharth Jaggi

Proceedings of the IEEE International Symposium on Information Theory, 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

Empirical Properties of Good Channel Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Local Decoding and Update of Compressed Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

Some "goodness" properties of LDA lattices.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

2016

A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity.

[BibT_eX]

[DOI]

CoRR, 2016

Pattern maximum likelihood estimation of finite-state discrete-time Markov chains.

[BibT_eX]

[DOI]

Pascal O. Vontobel

Proceedings of the IEEE International Symposium on Information Theory, 2016

A lattice coding scheme for secret key generation from Gaussian Markov tree sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Secure Compute-and-Forward in a Bidirectional Relay.

[BibT_eX]

[DOI]

Andrew Thangaraj

IEEE Trans. Inf. Theory, 2015

Nested lattice codes for secure bidirectional relaying with asymmetric channel gains.

[BibT_eX]

[DOI]