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.
By: Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz
Published in: International Symposium on Information Theory and its Applications (ISITA) 2018 , IEEE, p.10.23919/ISITA.2018.8664370 in 2018
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .