## Publications## Journal PapersG. M. Kamath, I. Shomorony, F. Xia, T. Courtade, and D. Tse, “HINGE: Long-read assembly achieves optimal repeat resolution”, Genome Research, 2017, doi:10.1101/gr.216465.116. T. Courtade, A. Grama, M. Mahoney, and T. Weissman (Eds.) “Principles and Applications of Science of Information”, Proceedings of the IEEE Special Issue, vol. 105, no. 2, Feb. 2017. I. Shomorony, T. A. Courtade, and D. Tse “Fundamental Limits of Genome Assembly under an Adversarial Erasure Model”. Shannon Centennial Special Issue of the IEEE Transactions on Molecular, Biological, and Multi-Scale Communications, 2016.A. Bhaskar, A. Javanmard, T. A. Courtade and D. Tse “Novel probabilistic models of spatial genetic ancestry with applications to stratification correction in genome-wide association studies”. Bioinformatics 2016. T. A. Courtade, “Monotonicity of Entropy and Fisher Information: A Quick Proof via Maximal Correlation”. Communications on Information and Systems, vol. 16, no. 2, pp.111-115, 2016.T. A. Courtade and T. R. Halford, “Coded cooperative data exchange for a secret key”. IEEE Transactions on Information Theory, July 2016, pp. 3785-3795.I. Shomorony, S. Kim, T. A. Courtade, and D. Tse, “Information-optimal genome assembly via sparse read-overlap graphs,” Bioinformatics 2016 32 (17): i494-i502.A. Puglielli, A. Townley, G. LaCaille, V. Milovanovic, P. Lu, K. Trotskovsky, A. Whitcombe, N. Narevsky, G.Wright, T. Courtade, E. Alon, B. Nikolic, and A. M. Niknejad, “Design of energy- and cost-efficient massive MIMO arrays”. Proceedings of the IEEE, March 2016, pp. 586-606.J. Jiao, T. A. Courtade, K. Venkat, and T. Weissman, “Justication of logarithmic loss via the benefit of side information”. IEEE Transactions on Information Theory, Oct. 2015, pp. 5357-5365.T. R. Halford, T. A. Courtade, K. M. Chugg, X. Li, and G. Thatte, “Energy efficient group key agreement for wireless networks”. IEEE Transactions on Wireless Communications, Oct. 2015, pp. 5552-5564.A. Ingber, T. A. Courtade, and T. Weissman, "Compression for Quadratic Similarity Queries”. IEEE Transactions on Information Theory, May 2015, pp. 2729-2747.T. A. Courtade “Comments on ‘Canalizing Boolean Functions Maximize Mutual Information’“. IEEE Transactions on Information Theory, February 2015, pp. 1149-1151.J. Jiao, T. A. Courtade, A. No, K. Venkat, and T. Weissman, “Information measures: The Curious Case of the Binary Alphabet”. IEEE Transactions on Information Theory, December 2014, pp. 7616 - 7626.T. A. Courtade and G. R. Kumar, "Which Boolean Functions Maximize Mutual Information on Noisy Inputs?”. IEEE Transactions on Information Theory, August 2014, pp. 4515-4525.J. Wang, K. Vakilinia, T.-Y. Chen, T. A. Courtade, G. Dong, T. Zhang, H. Shankar and R. Wesel, “Enhanced Precision Through Multiple Reads for LDPC Decoding in Flash Memories”. JSAC special issue on Communication Methodologies for the Next-Generation Storage Systems, May 2014, pp. 880-891.T. A. Courtade and R. D. Wesel, “Coded Cooperative Data Exchange in Multihop Networks”. IEEE Transactions on Information Theory, Feb 2014, pp. 1136-1158.T. A. Courtade and T. Weissman, “Multiterminal Source Coding under Logarithmic Loss”. IEEE Transactions on Information Theory, January 2014, pp. 740-761.B. Xie, T. A. Courtade, and R. D. Wesel, “Optimal Independent Encoding Schemes for Several Classes of Discrete Degraded Broadcast Channels”. IEEE Transactions on Information Theory, March 2013, pp. 1360-1378.T. A. Courtade and R. D. Wesel, “Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels”. IEEE Transactions on Communications, August 2011, pp. 2101 - 2109.
## PreprintsT. Courtade, M. Fathi, and A. Pananjady, “Existence of Stein Kernels under a Spectral Gap, and Discrepancy Bounds” T. Courtade, M. Fathi, and A. Pananjady, “Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities” T. Courtade, “Entropy Jumps for Radially Symmetric Random Vectors” A. Pananjady, M. J. Wainwright, and T. A. Courtade, “Linear regression with an unknown permutation: Statistical and computational limits”. T. Courtade, “Strengthening the entropy power inequality” A. Pananjady and T. A. Courtade, “Compressing Sparse Sequences under Local Decodability Constraints”. T. Courtade and J. Jiao, “An extremal inequality for long Markov chains”.
## Conference PapersA. Pananjady, M. Wainwright and T. Courtade, “Linear Regression with an Unknown Permutation: Statistical and Computational Limits”. 54th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, Oct. 2016.T. Courtade, “Strengthening the entropy power inequality”, IEEE International Symposium on Information Theory (ISIT). Barcelona, July 2016.J. Hui, I. Shomorony, K. Ramchandran, and T. Courtade, “Overlap-based genome assembly from variable-length reads”. IEEE International Symposium on Information Theory (ISIT). Barcelona, July 2016.I. Shomorony, G. M. Kamath, F. Xia, T. Courtade, and D. Tse, “Partial DNA assembly: A rate-distortion perspective”. IEEE International Symposium on Information Theory (ISIT). Barcelona, July 2016.J. Liu, T. A. Courtade, P. Cuff, and S. Verdú, “Brascamp-Lieb inequality and its reverse: An information theoretic view”. IEEE International Symposium on Information Theory (ISIT). Barcelona, July 2016.J. Liu, T. A. Courtade, P. Cuff, and S. Verdú, “Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation”. IEEE International Symposium on Information Theory (ISIT). Barcelona, July 2016.T. Courtade and A. Özgür, “Approximate Capacity of Gaussian Relay Networks: Is a Sublinear Gap to the Cutset Bound Plausible?”. IEEE International Symposium on Information Theory (ISIT). Hong Kong, July 2015.I. Shomorony, T. Courtade, and D. Tse, “Do Read Errors Matter for Genome Assembly?”. IEEE International Symposium on Information Theory (ISIT). Hong Kong, July 2015.A. Pananjady and T. Courtade. “Compressing Sparse Sequences under Local Decodability Constraints ”. IEEE International Symposium on Information Theory (ISIT). Hong Kong, July 2015.A. Puglielli, N Narevsky, P. Lu, T. Courtade, G. Wright, B. Nikolic, and E. Alon. “A Scalable Massive MIMO Array Architecture Based on Common Modules”. IEEE ICC 2015 - Workshop on 5G and Beyond - Enabling Technologies and Applications. London, UK, June 2015.T. Courtade and J. Jiao, “An Extremal Inequality for Long Markov Chains”. 52nd Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, Oct. 2014.J. Jiao, T. Courtade, A. No, K. Venkat, and T. Weissman, “Information Divergences and the Curious Case of the Binary Alphabet”. IEEE International Symposium on Information Theory (ISIT). Honolulu, Hawaii, June-July 2014.J. Jiao, T. Courtade, K. Venkat, and T. Weissman, “Justification of Logarithmic Loss via the Benefit of Side Information”. IEEE International Symposium on Information Theory (ISIT). Honolulu, Hawaii, June-July 2014.T. Courtade and T. Halford, “Coded Cooperative Data Exchange for a Secret Key”. IEEE International Symposium on Information Theory (ISIT). Honolulu, Hawaii, June-July 2014.T. Courtade and S. Verdú, “Cumulant Generating Function of Codeword Lengths in Optimal Lossless Compression”. IEEE International Symposium on Information Theory (ISIT). Honolulu, Hawaii, June-July 2014.T. Courtade and S. Verdú, “Variable-length Lossy Compression and Channel Coding: Non-asymptotic Converses via Cumulant Generating Functions”. IEEE International Symposium on Information Theory (ISIT). Honolulu, Hawaii, June-July 2014.T. Courtade, J. Jiao, and T. Weissman, “On an Extremal Data Processing Inequality for long Markov Chains”. International Zurich Seminar on Communications. Zurich, Switzerland, February 2014.T. Halford, T. Courtade, and K. Chugg, “Energy-Efficient, Secure Group Key Agreement for Ad Hoc Networks”. IEEE Conference on Communications and Network Security (CNS). Washington, DC, Oct. 2013.T. A. Courtade, “Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality”. IEEE International Symposium on Information Theory (ISIT). Istanbul, Turkey, July 2013.G. R. Kumar and T. A. Courtade, “Which Boolean Functions are Most Informative?”. IEEE International Symposium on Information Theory (ISIT). Istanbul, Turkey, July 2013.A. Ingber, T. A. Courtade, and T. Weissman, "Compression for Exact Match Identification”. IEEE International Symposium on Information Theory (ISIT). Istanbul, Turkey, July 2013.A. Ingber, T. A. Courtade, and T. Weissman, "Quadratic Similarity Queries on Compressed Data”. Data Compression Conference (DCC). Snowbird, UT, March 2013.T. R. Halford, T. A. Courtade, and K. Turck, "The User Capacity of Barrage Relay Networks”. IEEE Military Communications Conference (MILCOM). Orlando, FL, Oct. 2012.T. A. Courtade. "Information Masking and Amplification: The Source Coding Setting”. IEEE International Symposium on Information Theory (ISIT). Cambridge, MA, July 2012.T. A. Courtade and T. Weissman. "Multiterminal Source Coding under Logarithmic Loss”. IEEE International Symposium on Information Theory (ISIT). Cambridge, MA, July 2012.
**Best student authored paper award**.J. Wang, T. A. Courtade, H. Shankar, and R. D. Wesel. "Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization”. IEEE Global Telecommunications Conference (GLOBECOM). Houston, TX, Dec. 2011.T. A. Courtade, J. Wang, and R. D. Wesel. "Superposition Coding to Support Multiple Streams, Priorities, and Channel Capacities in the Context of GMSK”. Military Communications Conference (MILCOM). Baltimore, MD, Nov. 2011.T. A. Courtade and R. D. Wesel. "Weighted Universal Recovery, Practical Secrecy, and an Efficient Algorithm for Solving Both”. 49th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, Oct. 2011.B. Xie, M. van der Schaar, T. A. Courtade, and R. D. Wesel. “Minimizing weighted sum finish time for one-to-many file transfer in peer-to-peer networks”. 49th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, Oct. 2011.T. A. Courtade and R. D. Wesel. "Multiterminal source coding with an entropy-based distortion measure”. IEEE International Symposium on Information Theory (ISIT). Saint Petersburg, Russia, Aug. 2011.T. A. Courtade, B. Xie, and R. D. Wesel. “Optimal exchange of packets for universal recovery in broadcast networks”. Military Communications Conference (MILCOM). San Jose, CA, Nov. 2010.T. A. Courtade and R. D. Wesel. “Efficient universal recovery in broadcast networks”. 48th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, Oct. 2010.T. Courtade and R. D. Wesel. "A deterministic approach to rate-compatible fountain communication”. Information Theory and Applications Workshop (ITA). La Jolla, CA, Feb. 2010.T. A. Courtade and R. D. Wesel. ”A Cross-Layer Perspective on Rateless Coding for Wireless Channels”. IEEE International Conference on Communications (ICC). Dresden, Germany, June 2009.A. Marinoni, T. A. Courtade, and R. D. Wesel. “Spectrally Efficient LDPC Coded Modulations”. GTTI Sessione Trasmissione. Parma, Italy, June 2009.
**Best paper by a young scientist, Transmission Session**.
## DissertationT. A. Courtade. “Two Problems in Multiterminal Information Theory”. University of California, Los Angeles, May 2012.
**Distinguished Ph.D. Dissertation Award, Signals & Systems Track**.
## PatentsT. R. Halford, T. A. Courtade, and K. M. Chugg, “Secure group key agreement for wireless networks," Pat. 9084112 (US). July, 2015 T. A. Courtade and D. J. Jensen. “Digital Beamforming Method and Apparatus for Pointing and Null Steering Without Calibration or Calculation of Covariance Matrix”. Pat. 7570211 (US). Aug. 2009. T. A. Courtade and D. J. Jensen. “Method for Efficiently Computing the Beamforming Weights for a Large Antenna Array”. Pat. 7414578 (US). Aug. 2008.
IEEE disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |