Optimum cyclic redundancy-check codes with 16-bit redundancy

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 sup...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 1990, Vol.38 (1), p.111-114
Hauptverfasser: CASTAGNOLI, G, GANZ, J, GRABER, P
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.46536