scholarly journals A greedy search for improved QC LDPC codes with good girth profile and degree distribution

2012 ◽  
Author(s):  
Irina E. Bocharova ◽  
Florian Hug ◽  
Rolf Johannesson ◽  
Boris D. Kudryashov
Keyword(s):  
Degree Distribution ◽  
Ldpc Codes ◽  
Greedy Search

A Greedy Search Based Method with Optimized Lower Bound for QC-LDPC Codes

2017 ◽  
Author(s):  
Ambar Bajpai ◽  
Abhishek Kalsi ◽  
Suvit Nakpeerayuth ◽  
Piya Kovintavewat ◽  
Lunchakorn Wuttisittikulkij
Keyword(s):  
Lower Bound ◽  
Ldpc Codes ◽  
Greedy Search

Degree Distribution Design for LDPC Codes: A Derivative Matching Approach

2011 ◽  
Vol 59 (11) ◽  
pp. 3007-3015
Author(s):  
Enrico Paolini ◽  
Marco Chiani ◽  
Marc P. C. Fossorier
Keyword(s):  
Degree Distribution ◽  
Ldpc Codes

scholarly journals Counting short cycles of (c,d)-regular bipartite graphs

2020 ◽  
pp. 2150022
Author(s):  
M. Alinejad ◽  
K. Khashyarmanesh
Keyword(s):  
Degree Distribution ◽  
Ldpc Codes ◽  
Bipartite Graphs ◽  
Computational Approach ◽  
Parity Check ◽  
Closed Cycle ◽  
Low Density Parity Check ◽  
Number Of Cycles ◽  
Regular Bipartite Graph ◽  
Positive Integers

Recently, Tanner graphs which represented low density parity check (LDPC) codes have become an interesting research topic. Finding the number of short cycles of Tanner graphs motivated Blake and Lin to investigate the multiplicity of cycles of length equal to the girth of bi-regular bipartite graphs by using the spectrum and degree distribution of the graph. While there were many algorithms to find the number of cycles, they chose to take a computational approach. Dehghan and Banihashemi counted the number of cycles of length [Formula: see text] and [Formula: see text] where [Formula: see text] is a bi-regular bipartite graph and [Formula: see text] is the girth of [Formula: see text] But for the cycles of length smaller than [Formula: see text] in bi-regular bipartite graphs, they only proposed a descriptive technique. In this paper, we find the number of cycles of length less than [Formula: see text] by using the spectrum and the degree distribution of bi-regular bipartite graphs such that the formula depends only on the partitions of positive integers and the number of closed cycle-free walks from any vertex of [Formula: see text] and [Formula: see text] which are known.

Enumeration of the Degree Distribution Space for Finite Block Length LDPC Codes

2021 ◽  
Author(s):  
Spencer Giddens ◽  
Marco A. C. Gomes ◽  
Joao P. Vilela ◽  
Jose L. Santos ◽  
Willie K. Harrison
Keyword(s):  
Degree Distribution ◽  
Ldpc Codes ◽  
Block Length ◽  
Distribution Space
Sign in / Sign up

Export Citation Format

Share Document