.png){kind=icon}
返回
An integer programming-based search technique for error-prone structures of LDPC codes
.png){kind=icon}
OA
AI
DOI：10.1016/j.aeue.2014.05.012.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an efficient, general framework is presented for finding common, devastating error-prone structures (EPS) of any finite-length low-density parity-check (LDPC) code. The smallest stopping set for the binary erasure channel (BEC), the smallest fully absorbing set, the smallest absorbing set, and the smallest elementary trapping set for the binary symmetric channel (BSC) are found and the dominant EPS are enumerated. The method involves integer programming optimization techniques, which guarantees that the results are provably optimal. (C) 2014 Elsevier GmbH. All rights reserved.
Keyword:
Trapping sets
Stopping sets
Absorbing sets
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
A
IF:
3.2
论文数:
5.8K
被引数:
8.3K
机构
引用论文
.png){kind=icon}
分享收藏Glucose patterns following alcohol and illicit drug use in young adults with type 1 diabetes: A flash glucose monitoring study1型糖尿病年轻成年人在饮酒和使用非法药物后的血糖模式：一项瞬态血糖监测研究OAAI
OAAI分享收藏
查看更多内容