OPTIMUM CYCLIC REDUNDANCY-CHECK CODES WITH 16-BIT REDUNDANCY

被引：60

作者：

CASTAGNOLI, G

GANZ, J

GRABER, P

机构：

[1] Institute for Signal and Information Processing, Swiss Federal Institute of Technology, ETH-Zentrum

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1990年 / 38卷 / 01期

关键词：

D O I：

10.1109/26.46536

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

New optimal binary cyclic redundancy-check codes with 16 parity bits (CRC-16 codes) are presented and compared to those in existing standards for minimum distance, undetected-error probability on binary symmetric channels (BSC's) and properness. The new codes in several cases are seen to be superior at blocklengths of practical interest when used on low-noise BSC's. In addition, the optimum minimum distance obtainable by some CRC-16 code is determined for all blocklengths, and for several typical low-noise BSC's the minimum undetected error probability achievable with some CRC-16 code is given for all blocklengths. © 1990 IEEE

引用

页码：111 / 114

页数：4

共 8 条

[1]

HAMMOND J, 1986, PERFORMANCE ANAL LOC

[2] ON SOME PROPERTIES OF THE UNDETECTED ERROR PROBABILITY OF LINEAR CODES [J].