Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM63943
Volume:
10 |
5 |
May 2026
Pages:
1-5
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
computer science and engineering
MIST,Indore
computer science and engineering
MIST,Indore
Wireless networks are undergoing a paradigm shift with emergence of high performance internet of things (IoT). The demand for bandwidth has significantly risen due to multimedia applications and high speed data transfer. Due to the large data speeds and wireless nature of the channel, error detection and correction measures are indispensable for high trustworthiness in networks. This paper presents a comprehensive review on need of error detection and correction in wireless networks and the related work done in the domain. The emphasis has been laid on the error detection and correction employing the turbo encoding mechanism. The turbo encoding mechanism has been chosen as the baseline technique as it shows adherence to the Shannon’s limit while exhibiting a steep plummet in the error rate, in the error rate even at low SNR values. The important features of the turbo encoding-decoding process has been cited with explanations. A review of the various categories of turbo codes and similar approaches has been presented. Salient features of contemporary work have been cited.
KEYWORDS
This paper presents a comprehensive review on the need for trustworthiness in IoT and Fog networks. The introduction to error detection and correction pertaining to the trustworthiness of large scale wireless networks and IoT networks has been presented. Moreover, it has been shown that due to the effectiveness of Turbo Codes and their adherence to Shannon’s limit, they are the most suitable for high data rate networks. Previous work and their significant contribution have been cited and explained. This paper paves the path for future advancements in the domain of design of turbo codes for wireless IoT and Fog networks.
[1] X Wu, L Yang, M Qiu, C Han, J Yuan, “Half Spatially Coupled Turbo-Like Codes”, IEEE Internet Of Things Journal, 2025, vol. 5, no. 4, pp.22-31. [2] S. Zhao, J. Wen, S. Mumtaz, S. Garg and B. J. Choi, "Spatially Coupled Codes via Partial and Recursive Superposition for Industrial IoT With High Trustworthiness," in IEEE Transactions on Industrial Informatics 2024, vol. 16, no. 9, pp. 6143-6153. [3] Chaofan Chen , Li Li, Li Wang, Shuai Wang 1, Xiangming Li 1, George K. Karagiannidis, “Noncoherent Detection With Polar Codes”, IEEE 2023. [4] Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat, “Spatially Coupled Turbo-Like Codes”, IEEE 2022. [5] Suihua Cai, Nina Lin, and Xiao Ma, “Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders”, IEEE 2021. [6] Gianluigi Liva, Lorenzo Gaudio, Tudor Ninacs and Thomas Jerkovits, “Code Design for Short Blocks: A Survey”, IEEE 2020. [7] Erdal Arıkan, Daniel J. Costello, Jr., Joerg Kliewer, Michael Lentmaier, Paul Siegel, Ruediger Urbanke, Michael Pursley, “Guest Editorial Recent Advances in Capacity Approaching Codes”, IEEE 2019. [8] Boulat A. Bash, Dennis Goeckel, Saikat Guha, Don Towsley, “Hiding Information in Noise: Fundamental Limits of Covert Wireless Communication”, IEEE 2018. [9] Zunaira Babar, Soon Xin Ng and Lajos Hanzo, “EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design”, IEEE 2017. [10] Michael Lentmaiery, Saeedeh Moloudiy, and Alexandre Graell i Amat, “Braided Convolutional Codes – A Class of Spatially Coupled Turbo-Like Codes”, IEEE 2016.
Publication Date
5/26/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
2
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...