Low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel, and is constructed using a sparse bipartite graph. LDPC codes are capacity-approaching codes, LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth or return channel–constrained links in the presence of data-corrupting noise. In this Paper we investigating a promising technique for insertion, deletion and substitution errors. Information exchange between the inner decoder and outer decoder is not allowed in iterative decoding. Through numerical evaluations, we first find the marker code structures which offer the ultimate achievable rate when standard bit-level synchronization are performed. The output results which confirm the advantage of the newly designed codes over the ones optimized for the standard additive white Gaussian noise (AWGN) channels, In AWGN channel severe synchronization problem
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.