Multiple accumulated-crossover parallel concatenated SPC codes
From MaRDI portal
Publication:2267131
DOI10.1007/S11432-009-0103-ZzbMath1181.94122OpenAlexW2170904953MaRDI QIDQ2267131
Kai Guo, Jiandong Li, Yanhui Chen
Publication date: 26 February 2010
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-009-0103-z
iterative decodinglow density parity check codesparallel concatenated codessingle parity check codes
Cites Work
- Unnamed Item
- Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
- Regular and irregular progressive edge-growth tanner graphs
- Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
- Concatenated tree codes: a low-complexity, high-performance approach
- Good error-correcting codes based on very sparse matrices
This page was built for publication: Multiple accumulated-crossover parallel concatenated SPC codes