# Adaptive Learned Belief Propagation for Decoding Error-Correcting Codes
## Appendix C Parameters of Codes
_Knowl. Inf. Syst._**2013**, 35, 249-283. [CrossRef]
* [PERSON] (2024) [PERSON]; [PERSON]; [PERSON] Efficient active deep decoding of linear codes using importance sampling. _IEEE Commun. Lett._**2024**. [CrossRef]
* [PERSON] et al. (2025) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Database of Channel Codes and ML Simulation Results. 2024. Available online: [[https://rptu.de/channel-codes/ml-simulation-results](https://rptu.de/channel-codes/ml-simulation-results)]([https://rptu.de/channel-codes/ml-simulation-results](https://rptu.de/channel-codes/ml-simulation-results)) (accessed on 11 June 2025). * [PERSON] et al. (2001) [PERSON]; [PERSON]; [PERSON] Progressive edge-growth Tanner graphs. In Proceedings of the GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01 CH37270), San Antonio, TX, USA, 25-29 November 2001; Volume 2, pp. 995-1001. [CrossRef]
* [PERSON] (2025) [PERSON]; [PERSON] The Repository for the Papers on the Adaptive Weighted Belief Propagation. 2025. Available online: [[https://github.com/comsys2/adaptive-wbp](https://github.com/comsys2/adaptive-wbp)]([https://github.com/comsys2/adaptive-wbp](https://github.com/comsys2/adaptive-wbp)) (accessed on 11 June 2025). * [PERSON] (2015) [PERSON]; [PERSON] List decoding of Polar codes. _IEEE Trans. Inf. Theory_**2015**, 61, 2213-2226. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Tb/s Polar successive cancellation decoder 16 nm ASIC implementation. _arXiv_**2020**, arXiv:2009.09388. [CrossRef]
* [PERSON] et al. (2019) [PERSON] A.; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON]; et al. AFF3 CT: A fast forward error correction toolbox. _SoftwareX_**2019**, 10, 100345. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON] Normalized Neural Network for Belief Propagation LDPC Decoding. In Proceedings of the 2021 IEEE International Conference on Networking, Sensing and Control (ICNSC), Xiamen, China, 3-5 December 2021. * [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] Efficient termination of spatially-coupled codes. In Proceedings of the 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, 3-7 September 2012; pp. 30-34. [CrossRef]
* [PERSON] (2025) [PERSON] PocketSDR. 2024. Available online: [[https://github.com/tomojitakasu/PocketSDR/tree/master/python](https://github.com/tomojitakasu/PocketSDR/tree/master/python)]([https://github.com/tomojitakasu/PocketSDR/tree/master/python](https://github.com/tomojitakasu/PocketSDR/tree/master/python)) (accessed on 11 June 2025). * [PERSON] and [PERSON] (2004) [PERSON]; [PERSON] A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph. In Proceedings of the Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 7-10 November 2004; Volume 2, pp. 1990-1994. [CrossRef]
* [PERSON] and [PERSON] (2022) [PERSON]; [PERSON] [PERSON] Integer ring sieve for constructing compact QC-LDPC codes with girths 8, 10, and 12. _IEEE Trans. Inf. Theory_**2022**, 68, 35-46. [CrossRef]
* [PERSON] et al. (2006) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient encoding of quasi-cyclic low-density parity-check codes. _IEEE Trans. Commun._**2006**, 54, 71-81. [CrossRef]
* [PERSON] and [PERSON] (2017) [PERSON]; [PERSON] [PERSON] Edge spreading design of high rate array-based SC-LDPC codes. In Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 25-30 June 2017; pp. 2940-2944. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON] Efficient message passing scheduling for terminated LDPC convolutional codes. In Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russia, 31 July-5 August 2011; pp. 1826-1830. [CrossRef]
* [PERSON] et al.