Yucel Altug

IEEE Trans. Inf. Theory, 2021

2020

A New Method for Employing Feedback to Improve Coding Performance.

[BibT_eX]

[DOI]

Nirmal V. Shende

IEEE Trans. Inf. Theory, 2020

2018

Minimax Rényi Redundancy.

[BibT_eX]

[DOI]

Semih Yagli

IEEE Trans. Inf. Theory, 2018

When Does Feedback Improve the Second-Order Coding Rate in Discrete Memoryless Channels?

[BibT_eX]

[DOI]

Nirmal V. Shende

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

2016

On channel dispersion per unit cost.

[BibT_eX]

[DOI]

H. Vincent Poor

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

On fixed-length channel coding with feedback in the moderate deviations regime.

[BibT_eX]

[DOI]

H. Vincent Poor

Proceedings of the IEEE International Symposium on Information Theory, 2015

Variable-length channel codes with probabilistic delay guarantees.

[BibT_eX]

[DOI]

H. Vincent Poor

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Refinement of the Random Coding Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Moderate Deviations in Channel Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Refinement of the Sphere-Packing Bound: Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Feedback can improve the second-order coding performance in discrete memoryless channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The third-order term in the normal approximation for singular channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Lossless compression with moderate error probability.

[BibT_eX]

[DOI]

Ioannis Kontoyiannis

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

2012

Source and Channel Simulation Using Arbitrary Randomness.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Refinement of the sphere-packing bound.

[BibT_eX]

[DOI]

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

2011

Distributed Rate-Distortion With Common Components.

[BibT_eX]

[DOI]

Benjamin G. Kelly

IEEE Trans. Inf. Theory, 2011

Refinement of the sphere packing bound for symmetric channels.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Moderate deviation analysis of channel coding: Discrete memoryless case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

An Information Theoretic Analysis of Single Transceiver Passive RFID Networks

[BibT_eX]

[DOI]

Suleyman Serdar Kozat

Mehmet Kivanç Mihçak

CoRR, 2009

The lossy one-helper conjecture is false.

[BibT_eX]

[DOI]

Benjamin G. Kelly

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

On detection with partial information in the Gaussian setup.

[BibT_eX]

[DOI]

Onur Özyesil

M. Kivanç Mihçak

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

2008

A Note on the Periodicity and the Output Rate of Bit Search Type Generators.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On Minimax Optimal Linear Transforms for Detection with Side Information in Gaussian Setup.

[BibT_eX]

[DOI]

Mehmet Kivanç Mihçak

N. Polat Ayerden

IEEE Commun. Lett., 2008

Reliable Communications with Asymmetric Codebooks: An Information Theoretic Analysis of Robust Signal Hashing

[BibT_eX]

[DOI]

CoRR, 2008

Towards Exploring Fundamental Limits of System-Specific Cryptanalysis Within Limited Attack Classes: Application to ABSG

[BibT_eX]

[DOI]