Cart (Loading....) | Create Account
Close category search window

Erasure rate analysis and tighter upper bound for binary 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
$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)
Al-Shaikhi, A.A. ; KFUPM Univ., Dhahran ; Ilow, J.

Product codes are powerful codes that can be used to correct errors and/or recover erasures. Judging the erasure recovery performance of a product code based on its minimum distance is pessimistic because the code is actually capable of recovering many erasure patterns beyond those with the number of erasures determined by the minimum distance. By analyzing the non-recoverable erasure patterns, this letter develops a tighter upper bound on the post-decoding erasure rate for any binary product code. The analytical derivations are verified through computer simulations using Hamming and single parity check (SPC) product codes.

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 7 )

Date of Publication:

July 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.