.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Sparse-graph codes
minimum distance
EXIT chart
TLDPC ensemble
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Finite-Length Scaling of Turbo-Like Code Ensembles on the Binary Erasure Channel二进制擦除信道上类Turbo码集合的有限长度缩放
PREAI
分享收藏Soft Conductive Hydrogel-Based Electronic Skin for Robot Finger Grasping Manipulation.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏
查看更多内容