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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SN computer science Jg. 4; H. 5; S. 617
Hauptverfasser:	Saurabh, Shyam, Sinha, Kishore
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Singapore Springer Nature Singapore 01.09.2023 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!