By Topic

A combinatorial problem and a simple decoding method for cyclic codes (Corresp.)

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 relevant problem pertaining to the theory of runs is considered. The solution is given, and in the sequel, a useful identity (Lemma 2) is derived. It is shown how these results apply to decoding of systematic cyclic codes. This leads to a simply implemented error-correcting and detecting decoder. The decoder functions by searching for an error-free string of k consecutive digits. The efficiency of such a decoder is described. The quantitative values are given in Table I. The decoding efficiency is higher when errors occur in bursts, instead of being independently distributed. The use of feedback offers an attractive utilization of the intrinsic error-detecting capability.

Published in:

IEEE Transactions on Information Theory  (Volume:10 ,  Issue: 3 )