Multiple accumulated-crossover parallel concatenated SPC codes

DOI10.1007/S11432-009-0103-ZMaRDI QIDQ2267131zbMATH OpenOpenAlexFDO

Authors Kai Guo, Yanhui Chen, Jiandong Li

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

zbMATH Keywords

iterative decodinglow density parity check codesparallel concatenated codessingle parity check codes

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Burst-correcting codes (94B20)

Recommendations

• Parallel and serial concatenated single parity check product codes
• Generalized crossover product accumulate codes
• Single parity check product codes
• Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
• Asymptotic performance of single parity-check product codes

Cites work

• Concatenated tree codes: a low-complexity, high-performance approach
• Good error-correcting codes based on very sparse matrices
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
• Regular and irregular progressive edge-growth tanner graphs
• Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles

Cited in

(4)

• Parallel and serial concatenated single parity check product codes
• Generalized crossover product accumulate codes
• Cross parity check convolutional codes
• scientific article; zbMATH DE number 5692234 (Why is no real title available?)

This page was built for publication: Multiple accumulated-crossover parallel concatenated SPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267131)