Open Access
| Issue |
EPJ Web Conf.
Volume 374, 2026
1st International Conference on Electronic, Optical Devices and Intelligent Systems (ICEODIS 2026)
|
|
|---|---|---|
| Article Number | 01003 | |
| Number of page(s) | 7 | |
| Section | Telecommunications, RF and Optical Engineering | |
| DOI | https://doi.org/10.1051/epjconf/202637401003 | |
| Published online | 24 June 2026 | |
- 3GPP TS 38.212, NR; Multiplexing and channel coding, V16.2.0, 2020. Doi: https://www.etsi.org/deliver/etsits/138200138299/138212/16.02.0060/ts_138212v160200p.pdf [Google Scholar]
- E. Arikan, Channel polarization: A method for constructing capacityachieving codes, IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, 2009. Doi: https://doi.org/10.1109/TIT.2009.2021379 [Google Scholar]
- P. Trifonov and V. Miloslavskaya, Polar subcodes, IEEE Journal onSelected Areas in Communications , Volume: 34, Issue: 2, February 2016. Doi : https://doi.org/10.1109/JSAC.2015.2504269 [Google Scholar]
- R. G. Gallager, Low-density parity-check codes, IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, 1962. Doi : https://web.stanford.edu/class/ee388/papers/ldpc.pdf [Google Scholar]
- T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, 2008. Doi: https://assets.cambridge.org/97805218/52296/frontmatter/9780521852296_fi~ontmatter.pdf [Google Scholar]
- X. Wang et al., Optimization Design of Polar-LDPC Concatenated Scheme Based on Deep Learning, Computers & Electrical Engineering, Volume 84, June 2020. Doi: https://doi.org/10.1016/j.compeleceng.2020.106636 [Google Scholar]
- J. Chen and M. P. C. Fossorier, Density evolution for two improved BP-based decoding algorithms of LDPC codes, IEEE Commun. Lett., vol. 6, no. 5, pp. 208-210, May. 2002. Doi: https://doi.org/10.1109/4234.1001666 [Google Scholar]
- K. Niu and K. Chen, CRC-aided decoding of polar codes, IEEE Commun. Lett., vol. 16, no. 10, pp. 1668-1671, 2012. Doi: https://doi.org/10.1109/LCOMM.2012.090312.121501 [Google Scholar]
- D. J. C. MacKay and R. M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters, vol. 32, no. 18, pp. 1645-1646, 1996. DOI: doi: https://doi.org/10.1049/el:199611 [Google Scholar]
- R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, 1981. Doi: https://www.csd.uoc.gr/~hy538/projects/RecursiveLowComplexityCodes.pdf [CrossRef] [Google Scholar]
- T. Richardson and S. Kudekar, “Design of low-density parity check codes for 5G new radio, " IEEE Commun. Mag., vol. 56, no. 3, pp. 28-34, 2018. Doi: https://doi.org/10.1109/MCOM.2018.1700839 [Google Scholar]
- M. Fossorier, M. Mihaljevic and H. Imai, Reduced Complexity Iterative Decoding of Low-Density Parity-Check Codes Based on Belief Propagation, IEEE Transactions on Communications, vol.47, no.15, pp.673-680, May 1999. Doi: https://doi.org/10.1109/26.768759 [Google Scholar]
- R. Mori and T. Tanaka, “Performance of polar codes with the construction using density evolution,” IEEE Commun. Lett., vol. 13, no. 7, pp. 519-521, 2009. Doi: https://doi.org/10.1109/LCOMM.2009.0904 [Google Scholar]
- E. Arikan and E. Telatar, “On the rate of channel polarization,” in Proc. IEEE ISIT, 2009, pp. 1493-1495. Doi: https://dl.acm.org/doi/10.5555/1701116.1701126 [Google Scholar]
- B. Li, H. Shen, and D. Tse, “An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check,” IEEE Commun. Lett., vol. 16, no. 12, pp. 2044-2047, 2012. Doi: https://arxiv.org/pdf/1208.3091 [Google Scholar]
- V. Bioglio, C. Condo, and I. Land, “Design of polar codes for 5G new radio,” IEEE Commun. Surveys Tuts., vol. 23, no. 3, pp. 1819-1854, 2018. Doi: https://doi.org/10.48550/arXiv.1804.04389 [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.