pith. sign in

arxiv: 1401.7289 · v1 · pith:E7EOVCW7new · submitted 2014-01-28 · 💻 cs.IT · math.IT

Spatially-Coupled MacKay-Neal Codes with No Bit Nodes of Degree Two Achieve the Capacity of BEC

Takuya Okazaki , Kenta Kasai This is my paper
classification 💻 cs.IT math.IT
keywords codesachievecapacitydegreenodesmackay-nealsc-mnspatially-coupled
0
0 comments X
read the original abstract

Obata et al. proved that spatially-coupled (SC) MacKay-Neal (MN) codes achieve the capacity of BEC. However, the SC-MN codes codes have many variable nodes of degree two and have higher error floors. In this paper, we prove that SC-MN codes with no variable nodes of degree two achieve the capacity of BEC.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding

    quant-ph 2026-06 unverdicted novelty 6.0

    Spatially coupled MN/HA CSS codes achieve the quantum-erasure hashing bound under seeded BP decoding at the DE level for the X/Z equal-rate family.