On the girth of (3,L) quasi-cyclic LDPC codes based on complete protographs

Publication type: Proceedings Article
Publication date: 2015-06-01
Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We consider the problem of constructing $(3,L)$ quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with two disjoint vertex sets such that every vertex in the variable-node set is connected to every vertex in the check-node set by a unique edge. This paper analyzes the required lifting factor for achieving girths of six or eight in the resulting quasi-cyclic codes with constraints on lifting. The required lifting factors provide lower bounds on the block-length of such codes.
Found 
Found 

Top-30

Journals

1
2
3
4
IEEE Transactions on Communications
IEEE Transactions on Communications, 4, 30.77%
IEEE Transactions on Communications
4 publications, 30.77%
IEEE Access
IEEE Access, 4, 30.77%
IEEE Access
4 publications, 30.77%
Wireless Personal Communications
Wireless Personal Communications, 1, 7.69%
Wireless Personal Communications
1 publication, 7.69%
Designs, Codes, and Cryptography
Designs, Codes, and Cryptography, 1, 7.69%
Designs, Codes, and Cryptography
1 publication, 7.69%
1
2
3
4

Publishers

2
4
6
8
10
12
Institute of Electrical and Electronics Engineers (IEEE)
Institute of Electrical and Electronics Engineers (IEEE), 11, 84.62%
Institute of Electrical and Electronics Engineers (IEEE)
11 publications, 84.62%
Springer Nature
Springer Nature, 2, 15.38%
Springer Nature
2 publications, 15.38%
2
4
6
8
10
12
  • We do not take into account publications without a DOI.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
13
Share