Current Employer
Samsung Research America
Publications
[1]
E. MolavianJazi, M. Bloch, and J. N. Laneman, “Arbitrary Jamming Can Preclude Secure Communication,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2009, pp. 1069–1075. doi: 10.1109/allerton.2009.5394876.
[2]
E. MolavianJazi, “Secure Communications over Arbitrarily Varying Wiretap Channels,” Master’s thesis, University of Notre Dame, Notre Dame, IN, 2009.
[3]
E. MolavianJazi and J. N. Laneman, “Source-Channel Coding Tradeoff in Multiple Antenna Multiple Access Channels,” in Proc. IEEE Int. Symp. Information Theory (ISIT), St. Petersburg, Russia, Aug. 2011, pp. 1688–1692. doi: 10.1109/isit.2011.6033833.
[4]
E. MolavianJazi and J. N. Laneman, “Multiaccess Communication in the Finite Blocklength Regime,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2012.
[5]
E. MolavianJazi and J. N. Laneman, “Simpler Achievable Rate Regions for Multiaccess with Finite Blocklength,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Boston, MA, July 2012, pp. 36–40. doi: 10.1109/isit.2012.6284211.
[6]
E. MolavianJazi and J. N. Laneman, “A Random Coding Approach to Gaussian Multiple Access Channels with Finite Blocklength,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2012, pp. 286–293. doi: 10.1109/allerton.2012.6483231.
[7]
E. MolavianJazi, “The Gaussian Multi-Access Channel in the Finite Blocklength Regime,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Istanbul, Turkey, July 2013.
[8]
E. MolavianJazi and J. N. Laneman, “A Finite-Blocklength Perspective on Gaussian Multi-Access Channels.” arXiv Preprint, Aug. 2013. doi: 10.48550/arxiv.1309.2343.
[9]
E. MolavianJazi and J. N. Laneman, “On the Second-Order Coding Rate of Non-Ergodic Fading Channels,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2013. doi: 10.1109/allerton.2013.6736577.
[10]
E. MolavianJazi and J. N. Laneman, “On the Second-Order Cost of TDMA for Gaussian Multiple Access,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Honolulu, Hawaii, July 2014, pp. 266–270. doi: 10.1109/isit.2014.6874836.
[11]
E. MolavianJazi, “A Unified Approach to Gaussian Channels with Finite Blocklength,” PhD thesis, University of Notre Dame, Notre Dame, IN, 2014.
[12]
E. MolavianJazi and J. N. Laneman, “Coded Modulation for Gaussian Channels: Dispersion- and Entropy-Limited Regimes,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), New Orleans, LA, Mar. 2015, pp. 528–533. doi: 10.1109/wcnc.2015.7127525.
[13]
E. MolavianJazi and J. N. Laneman, “A Second-Order Achievable Rate Region for Gaussian Multi-access Channels via a Central Limit Theorem for Functions,” IEEE Trans. Inf. Theory, vol. 61, no. 12, pp. 6719–6733, Dec. 2015, doi: 10.1109/tit.2015.2492547.