5 citations · 6 across the 21 of their papers we have counts for
7 papers · 1 filter
MacKay-Neal Codes Achieve Capacity under MAP Decoding
Kenta Kasai
Statistical-mechanical analyses predict that MacKay-Neal codes can achieve channel capacity at fixed degrees. We prove this prediction for the uncoupled MN socket ense…
Spatially Coupled MacKay-Neal Codes on Symmetric Markov Noise: A Reduction to BMS Channels
Kenta Kasai
We prove a capacity criterion for fixed-degree spatially coupled MacKay--Neal codes on additive symmetric Markov noise. The noise bit flips with probability , so the channel has…
Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC
Kenta Kasai
We prove that a bounded shortened region initiates decoding throughout multidimensional spatially coupled regular LDPC and MacKay--Neal (MN) codes over the binary erasure channel (…
CPM-LDPC Codes Attaining the Minimum-Distance Bound
Kenta Kasai
We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minim…
Spatially Coupled MacKay-Neal Codes Achieve Capacity on BMS Channels at Fixed Degrees
Kenta Kasai
We establish two degree-dependent results for spatially coupled MacKay-Neal codes on binary-input memoryless symmetric channels. The ensembles use uniform random smoothing and shor…
Explicit Construction of Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12
Daiki Komoto, Kenta Kasai
This study proposes an explicit construction method for quantum quasi-cyclic low-density parity-check (QC-LDPC) codes with a girth of 12. The proposed method designs parity-check m…
Recursively Extended Permutation Codes under Chebyshev Distance
Tomoya Hirobe, Kenta Kasai
We study recursively extended permutation (REP) codes under the Chebyshev distance. An REP code is built by repeatedly inserting an allowed symbol in the first coordinate and relab…