research
∙
08/05/2023
High-dimensional Expansion of Product Codes is Stronger than Robust and Agreement Testability
We study the coboundary expansion property of product codes called produ...
share
research
∙
06/20/2022
Two-sided Robustly Testable Codes
We show that the tensor product of two random linear codes is robustly t...
research
∙
04/10/2022
On the Cleaning Lemma of Quantum Coding Theory
The term "Cleaning Lemma" refers to a family of similar propositions tha...
research
∙
11/05/2021
Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
We study classical and quantum LDPC codes of constant rate obtained by t...
research
∙
12/07/2020
Quantum LDPC Codes with Almost Linear Minimum Distance
We give a construction of quantum LDPC codes of dimension Θ(log N) and d...
research
∙
04/04/2019
