Published January 1, 1997
| public
Technical Report
Open
Two-Dimensional Interleaving Schemes with Repetitions
- Creators
- Blaum, Mario
-
Bruck, Jehoshua
- Farrell, Paddy
Chicago
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.
Files
etr016.pdf
Files
(899.1 kB)
Name | Size | Download all |
---|---|---|
md5:e3daf0243437279fdc236dcd967a5a55
|
899.1 kB | Preview Download |
Additional details
- Eprint ID
- 26058
- Resolver ID
- CaltechPARADISE:1997.ETR016
- Created
-
2002-09-03Created from EPrint's datestamp field
- Updated
-
2019-11-22Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group