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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SN computer science Ročník 4; číslo 5; s. 617
Hlavní autoři: Saurabh, Shyam, Sinha, Kishore
Médium: Journal Article
Jazyk:angličtina
Vydáno: Singapore Springer Nature Singapore 01.09.2023
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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