Recursive construction of (J,L) (J,L) QC LDPC codes with girth 6
In this paper, a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6. For a J×L J×L exponent matrix E E, the lower bound Q(E) Q(E) is obtained explicitly such that (J,L) (J,L) QC LDPC codes with girth at least 6 exist for...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Isfahan
2016-06-01
|
| Ráidu: | Transactions on Combinatorics |
| Fáttát: | |
| Liŋkkat: | http://www.combinatorics.ir/article_8430_4d65fe9a28acc359f137574e8342c0f4.pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|