.png){kind=icon}
.png){kind=icon}
Return
Designing a Good Low-Rate Sparse-Graph Code
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2012.082712.100205.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the design of low-rate sparse-graph codes, having a linear minimum distance d(min) in the block-length n. Its main contributions are: a) a necessary condition on a general family of sparse-graph codes with linear d(min); b) a justification of having degree-1 bits in the low-rate code structure; c) a new, efficient ensemble of low-rate sparse-graph codes with bits of degree 1, designed so that the necessary condition (a) is satisfied.
Keywords:
Sparse-graph codes
minimum distance
EXIT chart
TLDPC ensemble
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