Papers

  1. Efficiently decodable codes for the binary deletion channel. [ pdf ] [ arxiv ]
    Venkatesan Guruswami and Ray Li.
    RANDOM 2017.

  2. Coding against deletions in oblivious and online models. [ pdf ] [ arxiv ]
    Venkatesan Guruswami and Ray Li.
    Submitted to Symposium on Discrete Algorithms (SODA) 2018.

  3. Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. [ pdf ] [ arxiv ]
    Venkatesan Guruswami and Ray Li.
    International Symposium on Information Theory (ISIT) 2016

  4. Central Limit Theorems for Gaps of Generalized Zeckendorf Decompositions. [ pdf ] [ arxiv ]
    Ray Li and Steven J Miller.
    Submitted to the Fibonacci Quarterly.

  5. A Collection of Central Limit Type results in Generalized Zeckendorf Decompositions. [ pdf ] [ proceedings ]
    Ray Li and Steven J Miller.
    Proceedings of the 17th International Fibonacci Conference.

Talks

  1. Efficiently decodable codes for the binary deletion channel. [ slides ]
    RANDOM, August 18, 2017.

  2. A collection of central limit type results in Generalized Zeckendorf Decompositions. [ slides ]
    Young Mathematicians Conference (YMC), August 19, 2016.

  3. Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. [ slides ]
    International Symposium on Information Theory (ISIT), July 11, 2016.

  4. Convergence rates in generalized Zeckendorf decomposition problems. [ slides ]
    Workshop on Combinatorial and Additive Number Theory (CANT), May 26, 2016.

Thesis

  1. New developments in coding against insertions and deletions [ pdf ]
    Master's thesis, CMU, May 2017.