We stand with Ukraine  

Gleb Kalachev

Orcid: 0000-0003-2695-3179

According to our database1, Gleb Kalachev authored at least 8 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Maximally Extendable Product Codes are Good Coboundary Expanders.
[BibTeX]
[DOI]
Gleb Kalachev
,
Pavel Panteleev
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
Maximally Extendable Sheaf Codes.
[BibTeX]
[DOI]
Pavel Panteleev
,
Gleb Kalachev
CoRR, 2024

2023
High-dimensional Expansion of Product Codes is Stronger than Robust and Agreement Testability.
[BibTeX]
[DOI]
Gleb Kalachev
CoRR, 2023

2022
Quantum LDPC Codes With Almost Linear Minimum Distance.
[BibTeX]
[DOI]
Pavel Panteleev
,
Gleb Kalachev
IEEE Trans. Inf. Theory, 2022

Two-sided Robustly Testable Codes.
[BibTeX]
[DOI]
Gleb Kalachev
,
Pavel Panteleev
CoRR, 2022

On the Cleaning Lemma of Quantum Coding Theory.
[BibTeX]
[DOI]
Gleb Kalachev
,
Sergey Sadov
CoRR, 2022

Asymptotically good Quantum and locally testable classical LDPC codes.
[BibTeX]
[DOI]
Pavel Panteleev
,
Gleb Kalachev
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Degenerate Quantum LDPC Codes With Good Finite Length Performance.
[BibTeX]
[DOI]
Pavel Panteleev
,
Gleb Kalachev
Quantum, 2021


  Loading...