About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISITA 2018
Conference paper
Shortened Cyclic Codes for Correcting and Detecting Burst Errors
Abstract
New optimum binary shortened cyclic codes with redundancy r = 32 and burst-error correction capability b are presented. The codes are found by performing an exhaustive computer search using the Kasami algorithm, and their performance is compared with analytical bounds by Reiger, Abramson and Campopiano. The true burst-error correction capability of the [2112, 2080] shortened Fire code selected for 10 Gb/s Ethernet is determined to be b = 11 and [2112, 2080] shortened cyclic codes with higher burst-error correction capability b = 13 are given. The double burst-error detection properties of three cyclic redundancy check codes used in standards are compared.