TechRxiv
LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs.pdf (381.05 kB)
Download file

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

Download (381.05 kB)
preprint
posted on 08.07.2021, 02:08 by Shyam SaurabhShyam Saurabh

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 α 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.

History

Email Address of Submitting Author

SHYAMSAURABH785@GMAIL.COM

ORCID of Submitting Author

0000000251177311

Submitting Author's Institution

rANCHI uNIVERSITY

Submitting Author's Country

India

Usage metrics

Licence

Exports