By Topic

Modified product 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

4 Author(s)

By modifying product codes, a new coding scheme and its decoding method are proposed. Compared to a product code A , the first stage code A_{1} of the new code A_{M} is constructed in the same way as that of the code A except that it has at least one subcode, while the second stage codes A_{2}^{(j)} of the code A_{M} are a set of codes With the same length and different rates. The new coding scheme has a smaller upper bound on the probability of decoding error than the original product coding scheme for any given nonzero rate less than the capacity of a binary symmetric channel. An example is given for which the rate is increased compared With the original product code, at a fixed probability of decoding error, for a relatively short code length.

Published in:

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