By Topic

A novel approach for evaluating the performance of SPC product codes under erasure 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
$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)
M. A. Kousa ; Dept. of Electr. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia

Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit, referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. This paper develops a novel approach for deriving an upper bound on the post-decoding erasure rate for the SPC product code with iterative decoding. Simulation shows that the derived bound is very tight

Published in:

IEEE Transactions on Communications  (Volume:50 ,  Issue: 1 )