New construction of partial geometries based on group divisible designs and their associated LDPC codes

2020 ◽  
Vol 39 ◽  
pp. 100970
Author(s):  
Hengzhou Xu ◽  
Zhongyang Yu ◽  
Dan Feng ◽  
Hai Zhu
Keyword(s):  
Ldpc Codes ◽  
Group Divisible Designs ◽  
Group Divisible ◽  
Partial Geometries ◽  
New Construction

scholarly journals LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs

2021 ◽  
Author(s):  
Shyam Saurabh
Keyword(s):  
Block Design ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Finite Geometries ◽  
Group Divisible Designs ◽  
Tanner Graph ◽  
Group Divisible ◽  
Check Matrix ◽  
Balanced Incomplete Block ◽  
Resolvable Group

<p>Structured LDPC codes have been constructed using balanced incomplete block (BIB) designs, resolvable BIB designs, mutually orthogonal Latin rectangles, partial geometries, group divisible designs, resolvable group divisible designs and finite geometries. Here we have constructed LDPC codes from <i>α </i>–<b> </b>resolvable BIB and Group divisible designs. The sub–matrices of incidence matrix of such block design are used as a parity – check matrix of the code which satisfy row – column constraint. Here the girth of the proposed code is at least six and the corresponding LDPC code (or Tanner graph) is free of 4– cycles. </p>

A New Construction of Group Divisible Designs with Nonuniform Group Type

2016 ◽  
Vol 24 (8) ◽  
pp. 369-382
Author(s):  
Gennian Ge ◽  
Shuxing Li ◽  
Hengjia Wei
Keyword(s):  
Group Divisible Designs ◽  
Group Type ◽  
Group Divisible ◽  
New Construction

scholarly journals LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs

2021 ◽  
Author(s):  
Shyam Saurabh
Keyword(s):  
Block Design ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Finite Geometries ◽  
Group Divisible Designs ◽  
Tanner Graph ◽  
Group Divisible ◽  
Check Matrix ◽  
Balanced Incomplete Block ◽  
Resolvable Group

<p>Structured LDPC codes have been constructed using balanced incomplete block (BIB) designs, resolvable BIB designs, mutually orthogonal Latin rectangles, partial geometries, group divisible designs, resolvable group divisible designs and finite geometries. Here we have constructed LDPC codes from <i>α </i>–<b> </b>resolvable BIB and Group divisible designs. The sub–matrices of incidence matrix of such block design are used as a parity – check matrix of the code which satisfy row – column constraint. Here the girth of the proposed code is at least six and the corresponding LDPC code (or Tanner graph) is free of 4– cycles. </p>

Group Divisible Designs and Partial Geometries

1968 ◽  
Vol 17 (2-3) ◽  
pp. 115-122 ◽  
Author(s):  
Bhagwandas
Keyword(s):  
Regular Graph ◽  
Strongly Regular Graph ◽  
Group Divisible Designs ◽  
Group Divisible ◽  
Partial Geometries ◽  
Strongly Regular

Summary This paper gives a method of constructing group divisible ( GD) designs from partial geometries and investigates the structure of a certain strongly regular graph.

Characterization of Group Divisible Designs

2016 ◽  
Vol 4 (2) ◽  
pp. 161-175
Author(s):  
Jyoti Sharma ◽  
Jagdish Prasad ◽  
D. K. Ghosh
Keyword(s):  
Group Divisible Designs ◽  
Group Divisible

Resolvable modified group divisible designs with block size three

2006 ◽  
Vol 15 (1) ◽  
pp. 2-14 ◽  
Author(s):  
Chengmin Wang ◽  
Yu Tang ◽  
Peter Danziger
Keyword(s):  
Block Size ◽  
Group Divisible Designs ◽  
Group Divisible
Sign in / Sign up

Export Citation Format

Share Document