Yanina Shkel

Orcid: 0000-0002-2575-1762

According to our database1, Yanina Shkel authored at least 26 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Measuring Linkability of Protected Biometric Templates Using Maximal Leakage.
IEEE Trans. Inf. Forensics Secur., 2023

Indirect Rate Distortion Functions with f-Separable Distortion Criterion.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels.
IEEE J. Sel. Top. Signal Process., 2022

Second-Order Converse for Rate-Limited Common Randomness Generation.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Secrecy by Design With Applications to Privacy and Compression.
IEEE Trans. Inf. Theory, 2021

A Compression Perspective on Secrecy Measures.
IEEE J. Sel. Areas Inf. Theory, 2021

Secret Key Generation Over Wireless Channels using short Blocklength Multilevel Source Polar Coding.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Sum-Capacity of the MIMO Many-Access Gaussian Noise Channel.
IEEE Trans. Commun., 2019

Variable-length compression and secrecy by design.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Sum-Capacity of the MIMO Gaussian Many-Access Channel.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018
A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss.
IEEE Trans. Inf. Theory, 2018

A Coding Theorem for f-Separable Distortion Measures.
Entropy, 2018

Universal Compression, List Decoding, and Logarithmic Loss.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Secure lossless compression.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

Sequential prediction with coded side information under logarithmic loss.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Universal lossy compression under logarithmic loss.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2015
Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs.
IEEE Trans. Inf. Theory, 2015

Second-order coding rate for m-class source-channel codes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Achievability bounds for unequal message protection at finite block lengths.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On mismatched unequal message protection for finite block length joint source-channel coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
The AWGN Red Alert Problem.
IEEE Trans. Inf. Theory, 2013

Converse bounds for assorted codes in the finite blocklength regime.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
On the cooperative red alert exponent for the AWGN-MAC with feedback.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Cooperative reliability for streaming multiple access.
Proceedings of the IEEE International Symposium on Information Theory, 2010


  Loading...