default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShashank Vatedka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Yihan Zhang
, Shashank Vatedka:
Multiple Packing: Lower Bounds via Error Exponents. IEEE Trans. Inf. Theory 70(2): 1008-1039 (2024)- 2023
- [j7]Yihan Zhang, Shashank Vatedka:
Multiple Packing:Lower Bounds via Infinite Constellations. IEEE Trans. Inf. Theory 69(7): 4513-4527 (2023) - 2022
- [j6]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Local Decoding in Distributed Compression. IEEE J. Sel. Areas Inf. Theory 3(4): 711-719 (2022) - [j5]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. IEEE Trans. Inf. Theory 68(8): 4901-4948 (2022) - [j4]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. IEEE Trans. Inf. Theory 68(12): 7753-7786 (2022) - 2020
- [j3]Shashank Vatedka, Aslan Tchamkerten:
Local Decode and Update for Big Data Compression. IEEE Trans. Inf. Theory 66(9): 5790-5805 (2020) - 2017
- [j2]Shashank Vatedka, Navin Kashyap:
Some "goodness" properties of LDA lattices. Probl. Inf. Transm. 53(1): 1-29 (2017) - 2015
- [j1]Shashank Vatedka, Navin Kashyap, Andrew Thangaraj:
Secure Compute-and-Forward in a Bidirectional Relay. IEEE Trans. Inf. Theory 61(5): 2531-2556 (2015)
Conference and Workshop Papers
- 2024
- [c19]Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Entropy-Achieving Compression with Private Local Decodability. ISIT 2024: 3492-3497 - 2023
- [c18]Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Data Compression with Private Local Decodability. ISIT 2023: 1800-1805 - [c17]Ritesh Kumar, Shashank Vatedka:
Communication-Constrained Distributed Mean Estimation of Log-Concave Distributions. NCC 2023: 1-6 - 2022
- [c16]Yihan Zhang, Shashank Vatedka:
Lower Bounds on List Decoding Capacity using Error Exponents. ISIT 2022: 1324-1329 - [c15]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Locally Decodable Slepian-Wolf Compression. ISIT 2022: 1430-1435 - [c14]Yihan Zhang, Shashank Vatedka:
List-Decodability of Poisson Point Processes. ISIT 2022: 2559-2564 - [c13]Yihan Zhang, Shashank Vatedka:
Lower bounds for Multiple Packing. ISIT 2022: 3085-3090 - [c12]Srikanth Kamparaju, Shaik Mastan, Shashank Vatedka:
Low-Complexity Compression with Random Access. SPCOM 2022: 1-5 - 2020
- [c11]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi:
Quadratically Constrained Two-way Adversarial Channels. ISIT 2020: 1587-1592 - [c10]Qinghua Devon Ding, Sidharth Jaggi, Shashank Vatedka, Yihan Zhang:
Empirical Properties of Good Channel Codes. ISIT 2020: 2337-2342 - [c9]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression. ISIT 2020: 2371-2376 - [c8]Shashank Vatedka, Pascal O. Vontobel:
Modified Bethe Permanent of a Nonnegative Matrix. SPCOM 2020: 1-5 - 2019
- [c7]Shashank Vatedka, Aslan Tchamkerten:
Local Decoding and Update of Compressed Data. ISIT 2019: 572-576 - [c6]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. ISIT 2019: 1627-1631 - 2018
- [c5]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. ISIT 2018: 611-615 - 2016
- [c4]Shashank Vatedka, Navin Kashyap:
A lattice coding scheme for secret key generation from Gaussian Markov tree sources. ISIT 2016: 515-519 - [c3]Shashank Vatedka, Pascal O. Vontobel:
Pattern maximum likelihood estimation of finite-state discrete-time Markov chains. ISIT 2016: 2094-2098 - 2015
- [c2]Shashank Vatedka, Navin Kashyap:
Some "goodness" properties of LDA lattices. ITW 2015: 1-5 - [c1]Shashank Vatedka, Navin Kashyap:
Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. ITW 2015: 1-5
Informal and Other Publications
- 2022
- [i13]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Random Access in Distributed Source Coding. CoRR abs/2204.07518 (2022) - [i12]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower and Upper Bounds. CoRR abs/2211.04406 (2022) - [i11]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Infinite Constellations. CoRR abs/2211.04407 (2022) - [i10]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Error Exponents. CoRR abs/2211.04408 (2022) - 2020
- [i9]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi:
Quadratically Constrained Two-way Adversarial Channels. CoRR abs/2001.02575 (2020) - [i8]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
$O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression. CoRR abs/2001.08679 (2020) - 2019
- [i7]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. CoRR abs/1901.03790 (2019) - [i6]Shashank Vatedka, Aslan Tchamkerten:
Local Decode and Update for Big Data Compression. CoRR abs/1909.06444 (2019) - 2018
- [i5]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. CoRR abs/1801.05951 (2018) - 2016
- [i4]Shashank Vatedka, Navin Kashyap:
A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. CoRR abs/1601.05868 (2016) - [i3]Shashank Vatedka, Navin Kashyap:
A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. CoRR abs/1603.08236 (2016) - 2015
- [i2]Shashank Vatedka, Navin Kashyap:
Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains. CoRR abs/1506.02152 (2015) - 2014
- [i1]Shashank Vatedka, Navin Kashyap:
Some "Goodness" Properties of LDA Lattices. CoRR abs/1410.7619 (2014)
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-10-13 18:02 CEST 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:
