By Topic

A Practical Class of Polynomial 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
$31 $31
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)

Error detecting polynomial codes are usually formed by defining a correspondence between data bits and coefficients of the representative polynomial. These codes are easily implemented in hardware using shift registers; however, implementation in character-oriented processors may be too time consuming. A new class of polynomial codes is described for which a correspondence between n-bit data characters and polynomial coefficients is defined. Two particular types of these “character polynomial codes” are discussed; these may be easily implemented with hardware or with processor character manipulations. The burst error detecting ability of these two types of codes is shown to be the same as for the common “bit polynomial codes."

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:10 ,  Issue: 2 )