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

Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes

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

1 Author(s)
Abdel-Ghaffar, K.A.S. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA

The Reiger bound states that the redundancy n-logqM of any q-ary code, of M codewords of n letters each, that corrects bursts of size up to B is at least 2B (assuming that there are two disjoint bursts of size B that can be corrected by the code (Bossert and Sidorenko, 1996; and Reiger, 1960). In order to achieve the Reiger bound by interleaving single error-correcting codes, these codes should be MDS and the interleaving scheme should use only B of them. Such interleaving is straightforward in one-dimension. Here we consider the two-dimensional version of this problem

Published in:

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Date of Conference:

29 Jun-4 Jul 1997

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.