5 citations · 6 across the 20 of their papers we have counts for
17 papers · 1 filter
Pair-Partition Constructions for CPM-Based Quantum LDPC Codes
Koki Okada, Kenta Kasai
We introduce the pair-partition (PP) construction of binary Calderbank--Shor--Steane quantum low-density parity-check codes from circulant permutation matrices. A square array of p…
Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
Kenta Kasai
We study hard-erasure belief-propagation (BP), understood as the sum-product algorithm on erasure messages, for a punctured MacKay-Neal/Hsu-Anastasopoulos (MN/HA) representation of…
Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
Koki Okada, Kenta Kasai
We construct a rate- quantum low-density parity-check (LDPC) code from a -regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree…
A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP
Kenta Kasai
For CSS syndrome decoding, the two check matrices impose binary parity-check constraints on the two Pauli error components. The posterior can therefore be written as a binary facto…
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
Koki Okada, Kenta Kasai
This paper develops a two-branch multiplicative-coset construction for regular Calderbank--Shor--Steane (CSS) quantum low-density parity-check base matrices. For a target column we…
Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
Kenta Kasai
This paper investigates certified upper bounds on the minimum distance of an explicit family of Calderbank-Shor-Steane quantum LDPC codes constructed from affine permutation matric…