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 条
  • [1] A BOUNDED-DISTANCE DECODING ALGORITHM FOR THE LEECH LATTICE, WITH GENERALIZATIONS
    FORNEY, GD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (04) : 906 - 909
  • [2] Bounded-distance soft decision decoding of binary product codes
    Amrani, O
    Be'ery, Y
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 85 - 85
  • [3] THE LEECH LATTICE AND GOLAY CODE - BOUNDED-DISTANCE DECODING AND MULTILEVEL CONSTRUCTIONS
    AMRANI, O
    BEERY, Y
    VARDY, A
    SUN, FW
    FANTILBORG, HCA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1030 - 1043
  • [4] Chase-3-Like Algorithms Achieving Bounded-Distance Decoding
    Yan, Tingsu
    Tang, Yuansheng
    Chen, Ming
    IWSDA'09: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2009, : 80 - +
  • [5] Generating parity check equations for bounded-distance iterative erasure decoding
    Hollmann, Henk D. L.
    Tolhuizen, Ludo M. G. M.
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 514 - +
  • [6] Bounded-distance decoding: Algorithms, decision regions, and pseudo nearest neighbors
    Amrani, O
    Be'ery, Y
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (07) : 3072 - 3082
  • [7] Limited-trial chase-like bounded-distance decoding
    Weber, JH
    Fossorier, MPC
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 258 - 258
  • [8] Clustered Bounded-Distance Decoding of Codeword-Stabilized Quantum Codes
    Li, Yunfan
    Dumer, Ilya
    Grassl, Markus
    Pryadko, Leonid P.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 2662 - 2666
  • [9] On the Number of Search Centers of Chase-Like Bounded-Distance Decoding
    Tang, Yuansheng
    Huang, Xinmei
    Yan, Tingsu
    Chen, Ming
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1073 - +
  • [10] Low-complexity chase-like bounded-distance decoding algorithms
    Weber, JH
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1608 - 1612
12345