Mohammad Hossein Yassaee

Orcid: 0000-0001-9353-3073

According to our database1, Mohammad Hossein Yassaee authored at least 27 papers between 2008 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
f-Divergences and Their Applications in Lossy Compression and Bounding Generalization Error.
IEEE Trans. Inf. Theory, December, 2023

Statistics of Random Binning Based on Tsallis Divergence.
CoRR, 2023

2022
Supermodular f-divergences and bounds on lossy compression and generalization error with mutual f-information.
CoRR, 2022

2021
State Masking Over a Two-State Compound Channel.
IEEE Trans. Inf. Theory, 2021

Sequential Estimation under Multiple Resources: a Bandit Point of View.
CoRR, 2021

Learning under Distribution Mismatch and Model Misspecification.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2019
A Correlation Measure Based on Vector-Valued L<sub>p</sub>-Norms.
IEEE Trans. Inf. Theory, 2019

Sharp Bounds for Mutual Covering.
IEEE Trans. Inf. Theory, 2019

Covert Communication Over a Compound Channel.
CoRR, 2019

Almost Exact Analysis of Soft Covering Lemma via Large Deviation.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Correlation Measure Based on Vector-Valued Lp Norms.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Covert Communication Over a Compound Discrete Memoryless Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2017
Simulation of a Channel With Another Channel.
IEEE Trans. Inf. Theory, 2017

One-shot multivariate covering lemmas via weighted sum and concentration inequalities.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2015
Channel Simulation via Interactive Communications.
IEEE Trans. Inf. Theory, 2015

One-shot achievability via fidelity.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Achievability Proof via Output Statistics of Random Binning.
IEEE Trans. Inf. Theory, 2014

2013
Secure noisy network coding.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

When is it possible to simulate a DMC channel from another?
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Non-asymptotic output statistics of Random Binning and its applications.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A technique for deriving one-shot achievability results in network information theory.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Secure channel simulation.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Coordination via a relay.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Slepian-Wolf Coding Over Cooperative Relay Networks.
IEEE Trans. Inf. Theory, 2011

2010
Multiple Access Wiretap channels with strong secrecy.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Slepian-Wolf coding over cooperative networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Generalized compress-and-forward strategy for relay networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...