.png){kind=icon}
.png){kind=icon}
Return
4-Cycle Free LDPC Codes Based on Difference Sets
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2012.091112.110806.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Difference sets are used to give a novel method for constructing structured regular quasi-cyclic low-density parity-check codes. Let F-q be a field with q elements and assume that D = {d(1), ... , d(k)} is a ( v, k, 1)-difference set for Z(v) with d(1) < d(2) < ... < d(k). Depending on v = q - 1, v >= 2d(k) or v >= 2d(k-1), three code construction methods are given that produce regular 4-cycle free codes, that is codes with girth at least 6. Simulation results show that the constructed codes perform well over the AWGN channel with an iterative sum-product message-passing decoding algorithm.
Keywords:
LDPC codes
difference sets
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W