Paper Info
Title
Construction of Reed-Solomon Based Quasi-Cyclic LDPC Codes Based on Protograph.
Abstract
In this paper, we propose construction of Reed-Solomon(RS) based Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction. One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs to increase the upper bound of minimum Hamming distance for Proto-RS-QC-LDPC codes and simulate some experiment to show coding gain in sense of BER compare to existing QC-LDPC codes.
Year
DOI
Venue
2018
10.1109/APCC.2018.8633521
APCC
Keywords
Field
DocType
Hamming distance,Upper bound,Gain,Encoding,Reed-Solomon codes,Iterative decoding
Discrete mathematics,Coding gain,Computer science,Low-density parity-check code,Upper and lower bounds,Computer network,Reed–Solomon error correction,Hamming distance,Encoding (memory)
Conference
ISBN
Citations 
PageRank 
978-1-5386-6928-0
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
inseon kim101.69
Hong-Yeop Song232951.84