Phased burst error-correcting array codes

Creators: Goodman, Rodney M.; McEliece, Robert J.; Sayano, Masahiro

Style

An error occurred while generating the citation.

Abstract

Various aspects of single-phased burst-error-correcting array codes are explored. These codes are composed of two-dimensional arrays with row and column parities with a diagonally cyclic readout order; they are capable of correcting a single burst error along one diagonal. Optimal codeword sizes are found to have dimensions n1×n2 such that n2 is the smallest prime number larger than n1. These codes are capable of reaching the Singleton bound. A new type of error, approximate errors, is defined; in q-ary applications, these errors cause data to be slightly corrupted and therefore still close to the true data level. Phased burst array codes can be tailored to correct these codes with even higher rates than before

Additional Information

© 1993 IEEE. Reprinted with permission. Manuscript received November 4, 1991. R.M. Goodman and M. Sayano are supported in part by NSF Grant MIP-8711568. R.J. McEliece was supported by AFOSR Grant 91-0037 and a grant from Pacific Bell. This work was presented in part at the IEEE/CAM Information Theory Workshop, Cornel1 University, Ithaca, NY, June 25-29, 1989, in part at the International Symposium on Information Theory, San Diego, CA, January 14-19, 1990, and in part at the IEEE International Symposium on Information Theory, Budapest, Hungary, June 24-28, 1991. The authors would like to thank Dr. M. Blaum of IBM and Prof. P.G. Farrell of the University of Manchester for comments and suggestions

Attached Files

Published - GOOieeetit93.pdf

Files

GOOieeetit93.pdf

Files (1.0 MB)

Name	Size	Download all
GOOieeetit93.pdf md5:36727c1f03430e9e26cdb767376b9ff7	1.0 MB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes