Two-Dimensional Interleaving Schemes with Repetitions

Blaum, M. and Bruck, J. and Farrell, P. (1997) Two-Dimensional Interleaving Schemes with Repetitions. Technical Report. California Institute of Technology. [CaltechPARADISE:1997.ETR016]

Full text available as:

	PDF (Adobe PDF (900KB)) - Requires Adobe Acrobat Reader or other PDF viewer.
	Postscript - Requires a viewer, such as GhostView

Abstract

We present 2-dimensional interleaving schemes, with repetition, for correcting 2- dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area. A recent application of correction of 2-dimensional clusters appeared in the context of holographic storage. Known interleaving schemes are based on arrays of integers with the property that every connected component of area t consists of distinct integers. Namely, they are based on the use of 1-error-correcting codes. We extend this concept by allowing repetitions within the arrays, hence, providing a trade-off between the error-correcting capability of the codes and the degree of the interleaving schemes.

EPrint Type:	Monograph (Technical Report)
Additional Information:	[Alternate URL: http://www.paradise.caltech.edu/papers/etr016.ps]
Subjects:	All Records
ID Code:	39
Deposited By:	Jehoshua Bruck
Deposited On:	03 September 2002
Record Number:	CaltechPARADISE:1997.ETR016
Official Persistent URL:	http://resolver.caltech.edu/CaltechPARADISE:1997.ETR016
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record