By Topic

Optimum shortened cyclic codes for burst-error correction

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)

This paper is concerned with the construction of the most efficient shortened cyclic (pseudo-cyclic) codes that can correct every burst-error of length b or less. These codes have the maximum number of information digits k among all shortened cyclic burst- b codes with a given number of check digits r . The search procedure described is readily programmable for computer execution and efficient particularly for the case where r is close to the theoretical minimum of 2b check digits. For 2 \leq b \leq 10 , several optimum shortened cyclic codes in the above-mentioned sense have been found. Their code-lengths and generators are tabulated in this paper.

Published in:

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