This article is cited in 1 paper

Part 2. Mathematics and Computer Science

On asymptotically good families of classical and quantum LDPC codes

P. A. Panteleev, G. V. Kalachev

Lomonosov Moscow State University

Abstract: In this work it is shown that there exists an asymptotically good family of quantum LDPC codes, which proves the qLDPC conjecture. We also show that there exists an asymptotically good family of classical locally testable codes with constant query and soundness parameters, which also gives a positive solution of a well-known conjecture in the field of classical locally testable codes.

Keywords: locally testable codes, quantum LDPC codes, asymptotically good codes.