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

Codes correcting phased burst erasures

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)
Keren, O. ; Dept. of Electr. Eng. Syst., Tel Aviv Univ., Israel ; Litsyn, S.

We introduce a family of binary array codes of size t×n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e., being considered as codes over GF(2 t) they are MDS. The length of the codes is n=Σl=1 L(lt) where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL where r is the number of correctable erasures, and m is the smallest number such that 2t=1 modulo m. This compares favorably with the complexity of decoding codes obtained from the shortened general Reed-Solomon codes having the same parameters

Published in:

Electrical and Electronics Engineers in Israel, 1996., Nineteenth Convention of

Date of Conference:

5-6 Nov 1996

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.