Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference & Workshop on Emerging Trends in Technology

Decoding techniques of LDPC codes

Devashree Marotkar, N. A. Bodhaye

Published Feb 25, 2011• 1 citation
Publisher

Abstract

In this paper, we will Discuss Decoding technique of Low Density Parity check (LDPC) codes. Using Results we can evaluate which decoding procedure is better.
DOI
10.1145/1980022.1980238

Related papers

Decoding Techniques of LDPC Codes

Devashree Marotkar, Vivek Kapur, Shital S. Bramhe

In this paper, we will Discuss Decoding technique of Low Density Parity check (LDPC) codes.Using Results we can evaluate which decoding procedure is better.

IJIREEICE•Mar 15, 2015•3 citations

Performance Evaluation Of Low Density Parity Check Codes

Othman Omran Khalifa, Sheroz Khan, Mohamad Zaid +1 more

This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager.

•Nov 24, 2007•15 citations

Construction of Optimal Puncturing of Low-Density Parity-Check Codes

S. Suresh Kumar, Manju Rajaram

Low-density parity-check with Length-compatible and low error floors (LDPC-LCLEF) on the binary symmetric channel is presented in this paper. These codes can support a wide range of lengths for a given rate and also the Tanner graphs are free of small trapping sets. This can be obtained by applying the schemes of shortening and puncturing to good LDPC codes and the trapping sets are selected using the trapping set ontology based on their relative harmfulness for the given decoding algorithm. The conventional approach does not guarantee to have a good performance as the degree distributions may be wildly varied. In this paper, a modified algorithm is presented to generate LDPC codes of a given rate with almost their degree distributions are same as the mother code degree distribution. Also the relative harmfulness for different trapping sets are evaluated and decoding failures of one trapping set in presence or absence of other trapping sets are analyzed. To facilitate this discussion, a new description of structured LDPC codes with arrays of permutation matrices as parity-check matrices is given. Numerical results show that the LDPC code constructed by this approach performed much better than the conventional approach.

CiiT international journal of fuzzy systems•Jan 1, 2014•0 citations

A Comparative Review of Recent Advances in Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes and Their Applications

Michaelraj Kingston Roberts, Parthibaraj Anguraj

Archives of Computational Methods in Engineering•Jul 16, 2020•32 citations

A Study of Decoding Algorithm of Low Density Parity Check Code

Naoto Kobayashi, Ryo Nomura, Toshiyasu Matsushima

Technical report of IEICE. ISEC•Mar 12, 2002•1 citation

Density evolution for low-density parity-checkcodes under Max-Log-MAP decoding

X. Wei, Ali N. Akansu

A density evolution procedure for low-density parity-check (LDPC) codes under Max-Log-MAP decoding is presented. Using this technique, the precise convergence threshold for LDPC code could be easily derived.

Electronics Letters•Aug 30, 2001•29 citations
Low-density parity-check with Length-compatible and low error floors (LDPC-LCLEF) on the binary symmetric channel is presented in this paper. These codes can support a wide range of lengths for a given rate and also the Tanner graphs are free of small trapping sets. This can be obtained by applying the schemes of shortening and puncturing to good LDPC codes and the trapping sets are selected using the trapping set ontology based on their relative harmfulness for the given decoding algorithm. The conventional approach does not guarantee to have a good performance as the degree distributions may be wildly varied. In this paper, a modified algorithm is presented to generate LDPC codes of a given rate with almost their degree distributions are same as the mother code degree distribution. Also the relative harmfulness for different trapping sets are evaluated and decoding failures of one trapping set in presence or absence of other trapping sets are analyzed. To facilitate this discussion, a new description of structured LDPC codes with arrays of permutation matrices as parity-check matrices is given. Numerical results show that the LDPC code constructed by this approach performed much better than the conventional approach.