By Topic

Optimal covering polynomial sets and soft-decision error-trapping decoding

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
$31 $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

2 Author(s)
Wonjin Sung ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Coffey, J.T.

The covering polynomial method is an effective and simple way to decode cyclic codes. Essentially the idea is to augment an error-trapping decoder by adding a small search through error patterns in the information positions. Although it works best with codes having relatively small rate and correcting a small number of errors, it can be effectively extended to other cases with proper choices of the covering polynomial sets. Our goal is to find the minimal set of covering polynomials that traps all error patterns of given weight τ for given (n,k) cyclic code

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994