.png){kind=icon}
返回
Efficient Linear Programming Decoding of HDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2011.122110.090729.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose several improvements for Linear Programming (LP) decoding algorithms for High Density Parity Check (HDPC) codes. First, we use the automorphism groups of a code to create parity check matrix diversity and to generate valid cuts from redundant parity checks. Second, we propose an efficient mixed integer decoder utilizing the branch and bound method. We further enhance the proposed decoders by removing inactive constraints and by adapting the parity check matrix prior to decoding according to the channel observations. Based on simulation results the proposed decoders achieve near-ML performance with reasonable complexity.
Keyword:
Adaptive LP decoding
automorphism groups
BCH codes
belief propagation
branch and bound
linear programming
LP relaxation
pseudocodewords
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
分享收藏RGB-Marking to Identify Patterns of Selection and Neutral Evolution in Human Osteosarcoma Models.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容