activity
20032024
most citedGood Quantum LDPC Codes with Linear Time Decoders

10 citations · 63 across the 24 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

cs.CC2023

The linear time encoding scheme fails to encode

Yotam Dikstein, Irit Dinur, Shiri Sivan

We point out an error in the paper "Linear Time Encoding of LDPC Codes" (by Jin Lu and José M. F. Moura, IEEE Trans). The paper claims to present a linear time encoding algorithm f…

math.CO2023

Swap cosystolic expansion

Yotam Dikstein, Irit Dinur

We introduce and study swap cosystolic expansion, a new expansion property of simplicial complexes. We prove lower bounds for swap coboundary expansion of spherical buildings and u…

cs.IT2023

New Codes on High Dimensional Expanders

Irit Dinur, Siqi Liu, Rachel Yun Zhang

We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways…

cs.CC2023★ 1 cited

Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers

Yotam Dikstein, Irit Dinur

Given a family of subsets of and an ensemble of local functions , an agreement test is a randomized property tester that is supposed to test…

math.CO2023

Coboundary and cosystolic expansion without dependence on dimension or degree

Yotam Dikstein, Irit Dinur

We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homog…

math.CO2023

Bipartite unique-neighbour expanders via Ramanujan graphs

Ron Asherov, Irit Dinur

We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders construc…