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

Trends in Applied Sciences Research

Calculation of Girth of Tanner Graph in LDPC Codes

M. Ahmadi, H. Dehghani, Saeid Alikhani, Roslan Hasni

Published Nov 1, 2012• 5 citations
Publisher
DOI
10.3923/tasr.2012.929.934

Related papers

Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs

Kenya Sugihara, Hideo Yoshida

IEICE Technical Report; IEICE Tech. Rep.•Feb 24, 2011•0 citations

Some Derived Results for Constraints on the Tanner Graph Girth of Quasi-Cyclic Ldpc Codes

Huaan Li, Wenzhen Wang, Yunfei Fang +1 more

•Jan 1, 2024•0 citations

On the girth of Tanner (3,11) quasi-cyclic LDPC codes

Hengzhou Xu, Baoming Bai, Dan Feng +1 more

Finite Fields and Their Applications•Mar 23, 2017•12 citations

Node-splitting constructions for large girth irregular and protograph LDPC codes

Srinivas Subramanian, Asit Kumar Pradhan, Andrew Thangaraj

Low Density Parity Check (LDPC) codes have capacity-approaching performance over several channels of interest. In practice, for good block-error rate performance, the girth of the Tanner graph of an LDPC code needs to be as high as possible. In theory, to show that block-error rate approaches zero for increasing block-lengths, the girth of the Tanner graph sequence needs to tend to infinity with block-length. To meet these requirements, we construct sequences of large-girth irregular LDPC codes for a given degree-distribution pair (DDP) by applying a general node splitting algorithm on large girth graphs. The obtained Tanner graph meets the required DDP up to a suitable approximation. By optimizing the node-splitting method and using suitable large-girth graphs, we show code constructions with smaller block length for the same girth, when compared to previous constructions. Similar gains in block length are observed in the construction of sequences of large-girth protograph LDPC codes. Simulations, over a binary erasure channel, confirm the gains in block-error rate obtained by the large girth construction.

National Conference on Communications•Feb 1, 2014•0 citations

On the Girth of Tanner (5,7) Quasi-Cyclic LDPC Codes

Hengzhou, Xu Xu, Baoming +5 more

哈尔滨工业大学学报:英文版•Jan 1, 2017•1 citation

A new algorithm of counting the number of small stopping sets and girth in QC-LDPC Codes

Lingjun Kong, Yang Xiao

It is well known that the performance of low-density parity check (LDPC) codes under iterative decoding is determined by certain combinatorial structures (such as stopping sets and girth) in the Tanner graph. The difficulty in enumerating all possible combinations of the columns may prevent an efficient search of good LDPC codes with small stopping sets and girth. To solve the problem, this paper presents a new algorithm of counting the number of small stopping sets and girth by analyzing the shapes of the cycles of Tanner graph in parity check matrix for designing good LDPC codes which is less complex than the existing algorithms. This method can be used effectively to evaluate the performance of LDPC codes according to their small stopping sets and girth distributions.

International Conference on Signal Processing•Oct 1, 2008•0 citations
Low Density Parity Check (LDPC) codes have capacity-approaching performance over several channels of interest. In practice, for good block-error rate performance, the girth of the Tanner graph of an LDPC code needs to be as high as possible. In theory, to show that block-error rate approaches zero for increasing block-lengths, the girth of the Tanner graph sequence needs to tend to infinity with block-length. To meet these requirements, we construct sequences of large-girth irregular LDPC codes for a given degree-distribution pair (DDP) by applying a general node splitting algorithm on large girth graphs. The obtained Tanner graph meets the required DDP up to a suitable approximation. By optimizing the node-splitting method and using suitable large-girth graphs, we show code constructions with smaller block length for the same girth, when compared to previous constructions. Similar gains in block length are observed in the construction of sequences of large-girth protograph LDPC codes. Simulations, over a binary erasure channel, confirm the gains in block-error rate obtained by the large girth construction.
It is well known that the performance of low-density parity check (LDPC) codes under iterative decoding is determined by certain combinatorial structures (such as stopping sets and girth) in the Tanner graph. The difficulty in enumerating all possible combinations of the columns may prevent an efficient search of good LDPC codes with small stopping sets and girth. To solve the problem, this paper presents a new algorithm of counting the number of small stopping sets and girth by analyzing the shapes of the cycles of Tanner graph in parity check matrix for designing good LDPC codes which is less complex than the existing algorithms. This method can be used effectively to evaluate the performance of LDPC codes according to their small stopping sets and girth distributions.