Carol Wang

cwang dot ecc at gmail dot com

I recently completed a research fellowship at the National University of Singapore, working under Vincent Tan. I work in algebraic coding theory. I enjoy thinking about new and strange models of coding, particularly if there is a way to use Reed-Solomon codes to solve the problem. Most of my work is on finding efficient codes for settings where errors are adversarial.

I completed my PhD in 2015 at Carnegie Mellon University, under the supervision of Venkat Guruswami. My thesis was innovatively titled "Beyond unique decoding: Topics in error-correcting codes."

I am looking for a job in the Bay area! If you or anyone you know is inundated with errors which need to be corrected, or puzzles which need to be solved, please feel free to get in touch.


Error-free communication over state-dependent channels with variable-length feedback.
    M. Kovačević, C. Wang, and V. Tan.
    ISIT 2018. (arXiv.)

Coding for the binary energy harvesting channel with finite battery.
    C. Wang and M. Motani.
    Presented at ITW 2017.

An exact spectrum formula for the maximum size of finite length block codes.
    L. Chang, C. Wang, P. Chen, V. Tan, and Y. Han.
    ITW 2017. (arXiv.)
    (Note: It has since come to our attention that Theorem 1 is not new.)

Maximally recoverable codes for grid-like topologies.
    P. Gopalan, G. Hu, S. Kopparty, S. Saraf, C. Wang, and S. Yekhanin.
    SODA 2017. (arXiv.)

On the capacity of the binary adversarial wiretap channel.
    C. Wang.
    Presented at Allerton 2016. (arXiv.)

Explicit list-decodable rank-metric and subspace codes via subspace designs.
    V. Guruswami, C. Wang, and C. Xing.
    IEEE Transactions on Information Theory, 62(5). (IEEE.) Video of talk given at ICERM.

Limitations on testable affine-invariant codes in the high-rate regime.
    V. Guruswami, M. Sudan, A. Velingker, and C. Wang.
    SODA 2015. (ECCC.)

Deletion codes in the high-noise and high-rate regimes.
    V. Guruswami and C. Wang.
    Presented at RANDOM 2015. (arXiv.) Video of talk given at Simons Institute.
    IEEE Transactions on Information Theory, 63(4). (IEEE.)

Explicit rank-metric codes list-decodable with optimal redundancy.
    V. Guruswami and C. Wang.
    Presented at RANDOM 2014. (arXiv or ECCC.)

Linear-algebraic list decoding for variants of Reed-Solomon codes.
    V. Guruswami and C. Wang.
    IEEE Transactions on Information Theory, 59(6). (ECCC and IEEE.)

List decoding subspace codes from insertions and deletions.
    V. Guruswami, S. Narayanan, and C. Wang.
    Presented at ITCS 2012. (arXiv and ACM.)

Optimal rate list decoding via derivative codes.
    V. Guruswami and C. Wang.
    Presented at RANDOM 2011. (arXiv and Springer.)