Publications
] Filters: First Letter Of Last Name is M [Clear All Filters]
"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.
"Asymptotics of the Random-Coding Union Bound in Quasi-Static Fading Channels",
2016 Information Theory Workshop, Cambridge, UK, 09/2016.
"Asymptotics of the Random Coding Union Bound",
International Symposium on Information Theory and Its Applications, Singapore, 10/2018.
"Asymptotics of the Random Coding Error Probability for Constant-Composition Codes",
IEEE International Symposium on Information Theory, 2019/07.
"Asymptotics of the Error Probability in Quasi-Static Binary Symmetric Channels",
2017 IEEE International Symposium on Information Theory, Aachen, Germany, 06/2017.
Architecture for an iterative decoder,
, 09/2007.
"Applications of the simple bound: random codes, serial turbo codes and punctured codes",
Proc. 2002 Eur. Mobile/Personal Satcoms Conf. (EMPS 2002; Lake Maggiore, Italy), 2002.
"Analysis and design of natural and threaded space-time codes with iterative decoding",
Proceedings of the 36th Asilomar Conference on Signals, Systems and Computers, 36, vol. 1, no. 36, Pacific Grove, CA, US, IEEE: Institute of Electrical and Electronics Engineers, 2002.
"Amplitude Phase Shift Keying Constellation Design and its Applications to Satellite Digital Video Broadcasting",
Digital Video, pp. 425–452, 2010.
"Advanced Decoding Algorithms for Reed-Solomon/Convolutional Concatenated Codes",
Ann. des Télécom., vol. 60, no. 1-2, pp. 45-78, 2005.
"Advanced decoding algorithms for satellite broadcasting",
Proc. 8th Intl. Workshop on Sig. Proc. for Space Comm. (Catania, Italy), pp. 145–152, 2003.
"Achieving Csiszár's Source-Channel Coding Exponent with Product Distributions",
2012 IEEE International Symposium on Information Theory, Cambridge, MA, US, 07/2012.
"Achievable Rates and Exponents for Asynchronous Communication with ML Decoding",
2015 IEEE International Symposium on Information Theory, Hong Kong, IEEE, 06/2015.
"An Achievable Error Exponent for the Multiple Access Channel with Correlated Sources",
2017 IEEE International Symposium on Information Theory, Aachen, Germany, 06/2017.
