Publications
] Filters: First Letter Of Last Name is V [Clear All Filters]
"Converse Bounds for Finite-Length Joint Source-Channel Coding",
50th Annual Allerton Conference on Communication, Control and Computing, Allerton, IL, 10/2012.
"The Meta-Converse Bound is Tight",
2013 IEEE International Symposium on Information Theory, 07/2013.
"Source-Channel Coding with Multiple Classes",
IEEE International Symposium on Information Theory, Honolulu, HI, USA, 06/2014.
"Low-Complexity Fixed-to-Fixed Joint Source-Channel Coding",
8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2014), Bremen, Germany, 08/2014.
"A Derivation of the Source-Channel Error Exponent using Non-identical Product Distributions",
IEEE Transactions on Information Theory, vol. 60, issue 6, pp. 3209-3217, 2014.
"A Derivation of the Cost-Constrained Sphere-Packing Exponent",
2015 IEEE International Symposium on Information Theory, Hong Kong, IEEE, 06/2015.
"Hypothesis Testing and Quasi-Perfect Codes",
2016 International Zurich Seminar on Communications, 03/2016.
"Bayesian M-ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds are Tight",
IEEE Transactions on Information Theory, vol. 62, issue 5, pp. 2324-2333, 05/2016.
"Multi-Class Source-Channel Coding",
IEEE Transactions on Information Theory, vol. 62, issue 9, pp. 5093-5104, 09/2016.
"Dimension Spreading for Coherent Opportunistic Communications",
2017 51th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 10/2017.
"Saddlepoint Approximations of Lower and Upper Bounds to the Error Probability in Channel Coding",
2018 52nd Annual Conference on Information Systems and Sciences, Princeton, NJ, 03/2018.
"Codes for Channels with Segmented Edits",
IEEE Transactions on Information Theory, Special Issue in Memory of Solomon W. Golomb, vol. 64, issue 4, pp. 3086 - 3098, 04/2018.
"Coding for Deletion Channels with Multiple Traces",
IEEE International Symposium on Information Theory, 07/2019.
"The Error Probability of Generalized Perfect Codes via the Meta-Converse",
IEEE Transactions on Information Theory, vol. 65, 12/2019.
