Degenerate Quantum LDPC Codes With Good Finite Length Performance. - Pavel Panteleev; Gleb Kalachev (Quantum, 2021)

Asymptotically good Quantum and locally testable classical LDPC codes. - Pavel Panteleev; Gleb Kalachev (STOC, 2022)

On the Cleaning Lemma of Quantum Coding Theory. - Gleb Kalachev; Sergey Sadov (CoRR, 2022)

Two-sided Robustly Testable Codes. - Gleb Kalachev; Pavel Panteleev (CoRR, 2022)

Quantum LDPC Codes With Almost Linear Minimum Distance. - Pavel Panteleev; Gleb Kalachev (IEEE Trans. Inf. Theory, 2022)

High-dimensional Expansion of Product Codes is Stronger than Robust and Agreement Testability. - Gleb Kalachev (CoRR, 2023)

Maximally Extendable Sheaf Codes. - Pavel Panteleev; Gleb Kalachev (CoRR, 2024)

Maximally Extendable Product Codes are Good Coboundary Expanders. - Gleb Kalachev; Pavel Panteleev (CoRR, 2025)