Publications
] Filters: Author is Guillén i Fàbregas, Albert [Clear All Filters]
"Achievable Rates and Exponents for Asynchronous Communication with ML Decoding",
2015 IEEE International Symposium on Information Theory, Hong Kong, IEEE, 06/2015.
"The Error Probability of Generalized Perfect Codes via the Meta-Converse",
IEEE Transactions on Information Theory, vol. 65, 12/2019.
"Hypothesis Testing and Quasi-Perfect Codes",
2016 International Zurich Seminar on Communications, 03/2016.
"The Meta-Converse Bound is Tight",
2013 IEEE International Symposium on Information Theory, 07/2013.
"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.
"A Derivation of the Cost-Constrained Sphere-Packing Exponent",
2015 IEEE International Symposium on Information Theory, Hong Kong, IEEE, 06/2015.
"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.
"Large system analysis of iterative multiuser joint decoding with an uncertain number of users",
Proceedings of the IEEE International Symposium on information Theory Proceedings, Austin, TX, USA, IEEE, pp. 2103–2107, 2010.
"High-SNR analysis of optimum multiuser detection with an unknown number of users",
Proceedings of the IEEE on Information Theory Workshop, Taormina, Italy, IEEE, pp. 283–287, 2009.
"Converse Bounds for Finite-Length Joint Source-Channel Coding",
50th Annual Allerton Conference on Communication, Control and Computing, Allerton, IL, 10/2012.
"Random-Coding Bounds that Attain the Joint Source-Channel Exponent",
46th Annual Conference on Information Sciences and Systems, Princeton University, NJ, USA, 03/2012.
"Random-Coding Joint Source-Channel Coding Bounds",
2011 IEEE International Symposium on Information Theory (ISIT 2009), St. Petersburg, Russia, August, 2011.
"Large-System Analysis of Multiuser Detection with an Unknown Number of Users: A High SNR Approach",
IEEE Transactions on Information Theory, vol. 57, pp. 3416–3428, Jun., 2011.
"Achieving Csiszár's Source-Channel Coding Exponent with Product Distributions",
2012 IEEE International Symposium on Information Theory, Cambridge, MA, US, 07/2012.
"A Recursive Cost-Constrained Construction that Attains the Expurgated Exponent",
IEEE International Symposium on Information Theory, 07/2019.
"Generalized Random Gilbert-Varshamov Codes",
IEEE Transactions on Information Theory, vol. 65, issue 5, pp. 3452 - 3469, 05/2019.
"The Mismatched Multiple-Access Channel: General Alphabets",
2013 IEEE International Symposium on Information Theory, 07/2013.
"Mismatched Multi-letter Successive Decoding for the Multiple- Access Channel",
IEEE Transactions on Information Theory, vol. 64, issue 4, pp. 2253 - 2266, 04/2018.
"An Achievable Error Exponent for the Mismatched Multiple-Access Channel",
50th Annual Allerton Conference on Communication, Control and Computing, Allerton, IL, 10/2012.
"Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel",
IEEE International Symposium on Information Theory, Honolulu, HI, USA, 06/2014.
"The Likelihood Decoder: Error Exponents and Mismatch",
2015 IEEE International Symposium on Information Theory, Hong Kong, IEEE, 06/2015.
"Expurgated random-coding ensembles: Exponents, refinements and connections",
IEEE Transactions on Information Theory, vol. 60, issue 7, 07/2014.
"A Derivation of the Asymptotic Random-Coding Prefector",
51st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 10/2013.
"Superposition Codes for Mismatched Decoding",
2013 IEEE International Symposium on Information Theory, 07/2013.
