.png){kind=icon}
返回
Sparsifying parity-check matrices
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2020.106601.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code is the null space of this binary matrix. We consider the problem of minimizing the number of one-entries in parity-check matrices. In the maximum-likelihood (ML) decoding method, the number of ones in PCMs is directly related to the time required to decode messages. We propose a simple matrix row manipulation heuristic which alters the PCM, but not the code itself. We apply simulated annealing and greedy local searches to obtain PCMs with a small number of one entries quickly, i.e. in a couple of minutes or hours when using mainstream hardware. The resulting matrices provide faster ML decoding procedures, especially for large codes. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Parity-check matrix
Sparsifying matrices
Minimum decoders
Greedy search
Simulated annealing
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏Radiation-induced graft copolymerization of dimethylaminoethyl methacrylate onto graphene oxide for Cr(VI) removal辐射诱导甲基丙烯酸二甲基氨基乙酯在氧化石墨烯上的接枝共聚以去除Cr(VI)
PREAI
分享收藏Determination of bromine, chlorine, sulphur and phosphorus in peat by X-ray fluorescence spectrometry combined with single-element and multi-element standard addition.png)
Talanta
TalantaIF0
PREAI
分享收藏
查看更多内容