CRC in Coded Schemes with Bounded-Distance Decoding

被引：0
|
作者：
Abdel-Ghaffar, Khaled A. S. [1 ]
机构：
[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
来源：
2023 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC | 2023年
关键词：
Cyclic redundancy checks (CRC); bounded-distance decoding; error-correcting code; undetected error probability; REDUNDANCY-CHECK CODES;
D O I：
10.1109/WCNC55385.2023.10119062
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The undetected error probability of CRC combined with an error-correcting code with bounded-distance decoding is considered. It is shown that to minimize this probability, the CRC polynomial should be matched to the code. In particular, good CRC polynomials reported in the literature for pure CRC schemes may not be good when combined with coding. Guidelines to choose a good CRC polynomial to be combined with a given code are provided.
引用
收藏
页数：6
相关论文
共 50 条
12345