Theses most similar to Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness (Bazzi, Louay Mohamad Jamil, 1974-; 2003) read it

Generalized Dickson invariants

Arnon, Dan (1994)

  • Advisor: Michael J. Hopkins
  • Department of Mathematics
Read it

Path integrals on ultrametric spaces

Blair, Alan David, 1967- (1994)

  • Advisor: Gian-Carlo Rota
  • Department of Mathematics
Read it

Restricted branching programs and hardware verification

Ponzio, Stephen J. (Stephen John) (1995)

  • Advisor: Maricio Karchmer
  • Department of Electrical Engineering and Computer Science
Read it

Iterative algorithms for lossy source coding

Chandar, Venkat (Venkat Bala) (2006)

  • Advisors: Emin Martinian; Gregory Wornell
  • Department of Electrical Engineering and Computer Science
Read it

Computationally efficient error-correcting codes and holographic proofs

Spielman, Daniel Alan (1995)

  • Advisor: Michael Sipser
  • Department of Mathematics
Read it

Matchings, matroids and submodular functions

Harvey, Nicholas James Alexander (2008)

  • Advisor: Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Quantum operations and codes beyond the Stabilizer-Clifford framework

Zeng, Be (2009)

  • Advisor: Isaac L. Chuang
  • Department of Physics
Read it

Sparse graph codes for compression, sensing, and secrecy

Chandar, Venkat (Venkat Bala) (2010)

  • Advisors: Devavrat Shah; Gregory W. Wornell
  • Department of Electrical Engineering and Computer Science
Read it

Testability of linear-invariant properties

Bhattacharyya, Arnab (2011)

  • Advisor: Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Lower bounds on the classical simulation of quantum circuits for quantum supremacy

Dalzell, Alexander M (2017)

  • Advisor: Aram W. Harrow
  • Department of Physics
Read it