LDPC Codes Based on α-Resolvable Designs

Earlier regular low-density parity-check (LDPC) codes have been constructed using resolvable combinatorial designs. Here we have constructed LDPC codes from α -resolvable ( α > 1) designs which are generalization of resolvable designs. The LDPC codes obtained here from α -resolvable ( α > 1)...

Full description

Saved in:

Bibliographic Details
Published in:	SN computer science Vol. 4; no. 5; p. 617
Main Authors:	Saurabh, Shyam, Sinha, Kishore
Format:	Journal Article
Language:	English
Published:	Singapore Springer Nature Singapore 01.09.2023 Springer Nature B.V
Subjects:	Codes Combinatorial analysis Computer Imaging Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Error correcting codes Information Systems and Communication Service Low density parity check codes Original Research Parity Pattern Recognition and Graphics Software Engineering/Programming and Operating Systems Vision Tanner graph Resolvable designs Group divisible designs LDPC codes Balanced incomplete block designs
ISSN:	2661-8907, 2662-995X, 2661-8907
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Earlier regular low-density parity-check (LDPC) codes have been constructed using resolvable combinatorial designs. Here we have constructed LDPC codes from α -resolvable ( α > 1) designs which are generalization of resolvable designs. The LDPC codes obtained here from α -resolvable ( α > 1) designs have much higher code rate in comparison to the earlier codes for the same code length but constructed from resolvable designs.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	2661-8907 2662-995X 2661-8907
DOI:	10.1007/s42979-023-02088-2