most citedGood quantum LDPC codes with linear time decoder from lossless expanders

12 citations · 24 across the 5 of their papers we have counts for

collaborators

6 papers

quant-ph2023★ 1 cited

General Distance Balancing for Quantum Locally Testable Codes

Adam Wills, Ting-Chun Lin, Min-Hsiu Hsieh

In this paper, we prove a lower bound on the soundness of quantum locally testable codes under the distance balancing construction of Evra et al. arXiv:2004.07935 [quant-ph]. Our t…

cs.IT2022

Accelerating Polarization via Alphabet Extension

Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami +2

Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique.…

quant-ph2022★ 10 cited

Good Quantum LDPC Codes with Linear Time Decoders

Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin +1

We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain $(\mathbb{…

cs.IT2022

Sub-4.7 Scaling Exponent of Polar Codes

Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy +1

Polar code visibly approaches channel capacity in practice and is thereby a constituent code of the 5G standard. Compared to low-density parity-check code, however, the performance…

quant-ph2022★ 12 cited

Good quantum LDPC codes with linear time decoder from lossless expanders

Ting-Chun Lin, Min-Hsiu Hsieh

Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant numbe…

cs.IT2022★ 1 cited

-Locally Testable Codes from Lossless Expanders

Ting-Chun Lin, Min-Hsiu Hsieh

A locally testable code (LTC) is an error correcting code with a property tester. The tester tests if a word is codeword by reading constant random bits and rejects the word with p…