CaltechAUTHORS
  A Caltech Library Service

Interleaving Schemes for Multidimensional Cluster Errors

Blaum, Mario and Bruck, Jehoshua (1995) Interleaving Schemes for Multidimensional Cluster Errors. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:1995.ETR008

[img]
Preview
PDF (Adobe PDF (1.2MB))
See Usage Policy.

1174Kb
[img]
Preview
Postscript
See Usage Policy.

359Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:1995.ETR008

Abstract

We present 2 and 3-dimensional interleaving techniques for correcting 2 and 3- dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area or volume. A recent application of correction of 2-dimensional clusters appeared in the context of holographic storage. Our main contribution is the construction of efficient 2 and 3-dimensional interleaving schemes. The schemes are based on arrays of integers with the property that every connected component of area or volume t consists of distinct integers (we call these t-interleaved arrays). In the 2-dimensional case, our constructions are optimal in the sense that they contain the smallest possible number of distinct integers, hence minimizing the number of codes required in an interleaving scheme.


Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
http://www.paradise.caltech.edu/papers/etr008.psPublisherUNSPECIFIED
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:1995.ETR008
Persistent URL:http://resolver.caltech.edu/CaltechPARADISE:1995.ETR008
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26066
Collection:CaltechPARADISE
Deposited By: Imported from CaltechPARADISE
Deposited On:04 Sep 2002
Last Modified:26 Dec 2012 13:52

Repository Staff Only: item control page