Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-PM-2-1
Session:
Number:We-PM-2-1.4
Shortened Cyclic Codes for Correcting and Detecting Burst Errors
Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz,
pp.725-729
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-2-1.4
PDF download
Summary:
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 10Gb/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.