By Topic

Quasi-self-reciprocal polynomials and potentially large minimum distance BCH 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

2 Author(s)

We consider the problem of determining which irreducible polynomials with coefficients in a finite field GF(q) are quasi-self-reciprocal. Our characterization of these polynomials is in terms of a set of positive integers, Dq . Dq has applications to certain BCH codes. This work determines those codes (as specified by n , the length of the code, and not by k ) whose minimum-distance lower bound doubles when the root one is added to the code generator.

Published in:

IEEE Transactions on Information Theory  (Volume:15 ,  Issue: 1 )