Referenced Items are not available for this document.
In P. Corbett et a. (2004), the authors present a row-diagonal parity scheme with two parity columns for a (p - 1) times (p + 1) array, p a prime, that recovers any two erased columns. The code minimizes the number of XORs at the encoding. It was left as an open problem generalizing this scheme to multiple parities. In this paper, we present such a generalization. In particular, when we have three parity columns, the new code recovers any three erased columns. Efficient encoding and decoding algorithms are presented
Published in:
Information Theory, 2006 IEEE International Symposium on
Date of Conference: 9-14 July 2006
- Page(s):
- 2784 - 2788
- E-ISBN :
- 1-4244-0504-1
- Print ISBN:
- 1-4244-0505-X
- INSPEC Accession Number:
- 9164750
- Conference Location :
- Seattle, WA
- Digital Object Identifier :
- 10.1109/ISIT.2006.261569
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
