Jump to other IT Society Websites:
A collection of dissertations published on Information Theory. Authors are welcome to contribute their theses for others to read! Step-by-step instructions are in the Help Center.
Actions can speak more clearly than words
Ph.D. dissertation of Pulkit Grover, University of California, Berkeley, December 2010.
Capacity Analysis of Asymptotically Large MIMO Channels
Ph.D. Dissertation by Georgy Levin, Academic Advisor: Dr. Sergey Loyka, University of Ottawa, Ontario, Canada, June 2008.
Duality-Based Bounds on Channel Capacity
Ph.D. thesis of Stefan M. Moser, ETH Zurich, 2004. Advisor: Amos Lapidoth, Co-Advisor: I. Emre Telatar.
Error Control for Network Coding
Ph.D. Thesis of Danilo Silva, University of Toronto, Canada, 2009. Advisor: Frank Kschischang
Extremum Problems of Directed Information
Ph.D. dissertation of Photios A. Stavrou, University of Cyprus, Nicosia, April 2016. Advisor: Charalambos D. Charalambous
Generalized Minimum Distance Decoding with Arbitrary Error/Erasure Tradeoff
Ph.D. Thesis of Christian Senger, Ulm University, Ulm, Germany, 2011.
Information Loss in Deterministic Systems
PhD thesis of Bernhard C. Geiger, conducted 2014 under the supervision of Prof. Gernot Kubin at the Signal Processing and Speech Communication Lab, Graz University of Technology, Austria.
Information-Theoretic Capacity Limits in Multi-cell Joint Processing Systems
Ph.D. thesis by Symeon Chatzinotas, Centre for Communication Systems Research, University of Surrey, March 2009.
Cooperative Diversity in Wireless Networks: Algorithms and Architectures
Model-Centric Approach to Discrete-Time Signal Processing for Dense Wavelength-Division Multiplexing Systems
Houbing Song (2012). Model-Centric Approach to Discrete-Time Signal Processing for Dense Wavelength-Division Multiplexing Systems. Ph.D. Dissertation. University of Virginia, Charlottesville, VA, USA. Advisor: Maite Brandt-Pearce. AAI3536294.
On Connections Between Graphs, Codes, Quantum States, and Boolean Functions
Lars Eirik Danielsen: On Connections Between Graphs, Codes, Quantum States, and Boolean Functions. PhD thesis, Deptartment of Informatics, University of Bergen, Norway, May 2008. We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be represented as graphs, and that two codes are equivalent when the corresponding graphs are equivalent with respect to local complementation (LC). We give classifications of such codes.
On Some Linear Codes over Z_2^s
PhD dissertation of M.K. Gupta, Department of Mathematics and Statistics, Indian Institute of Technology (IIT), Kanpur, 2000.
Re-proving Channel Polarization Theorems: An Extremality and Robustness Analysis
Ph.D. dissertation, École Polytechnique Fédérale de Lausanne, Switzerland, January 2015.
Recurrence and Waiting Times in Stationary Processes, and their Applications in Data Compression
Ioannis Kontoyiannis, Ph.D. Thesis, EE Dept., Stanford University, 1998 Note that a lot of the results in this thesis have been subsequently extended or improved upon. See http://pages.cs.aueb.gr/users/yiannisk/pubs.html for more recent work
Robust and adaptive communication under uncertain interference
PhD Thesis of Anand D. Sarwate, University of California, Berkeley, July 2008.
Statistical and Information-Theoretic Methods for Data Analysis
Teemu Roos, PhD Dissertation