Window code parameters of spatially-coupled LDPC codes
From MaRDI portal
Publication:6580203
DOI10.1142/s0219498825501270zbMATH Open1546.94133MaRDI QIDQ6580203
Emily McMillon, Christine A. Kelley
Publication date: 29 July 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
minimum distanceiterative decodingTanner graphslow-density parity-check (LDPC) codesspatially coupled codescycle-free codeswindow codes
Could not fetch data.
Cites Work
- Design of Spatially Coupled LDPC Codes Over GF $(q)$ for Windowed Decoding
- Spatially Coupled LDPC Codes Constructed From Protographs
- Windowed Decoding of Spatially Coupled Codes
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Which codes have cycle-free Tanner graphs?
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
This page was built for publication: Window code parameters of spatially-coupled LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580203)
