By Topic

A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Dur ; Inst. fur Math., Innsbruck Univ., Austria

A novel fast algorithm is developed for computing the burst-correcting limit of a cyclic or shortened cyclic code from the parity-check polynomial of the cyclic code. The algorithm is similar to the algorithm of H.J. Matt and J.L. Massey (1980) which, up to now, has been the most efficient method for determining the burst-correcting limit of a cyclic code, but is based on apolarity of binary forms instead of linear complexity. The running times of implementations in C of both algorithms on an IBM RISC System/6000 are compared for several binary cyclic codes of practical interest. A table of the burst-correcting limit of primitive binary BCH codes of length up to 1023 is included.<>

Published in:

IEEE Transactions on Information Theory  (Volume:38 ,  Issue: 2 )