.png){kind=icon}
返回
Hard Reliability-Based Ordered Statistic Decoding and Its Application to McEliece Public Key Cryptosystem
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2021.3137529.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter constructs the hard reliability from the syndromes to decode low/moderate-density parity-check codes in an ordered statistic way. For regular codes with our proposed decoding algorithm, the error-correction capability can be determined by the column weight and the maximum column intersection of their parity-check matrices. Then, an upper bound is derived to verify their decoding performance in ultra-low region, which may be required by some applications, e.g., McEliece public key cryptosystem and optical communications. It allows us to reduce the size of McEliece public keys with strong security levels due to its good error-correction capability.
Keyword:
Codes
Decoding
Iterative decoding
Upper bound
Reliability engineering
Public key cryptography
Measurement uncertainty
McEliece public key cryptosystem
LDPC codes
hard reliability
ordered statistic decoding
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容