Published June 1997
| Published
Book Section - Chapter
Open
Two-dimensional interleaving schemes with repetitions
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. 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.
Additional Information
© 1997 IEEE. Date of Current Version: 06 August 2002. Supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship and by DARPA and BMDO through an agreement with NASA/OSAT.Attached Files
Published - BLAisit97b.pdf
Files
BLAisit97b.pdf
Files
(124.2 kB)
Name | Size | Download all |
---|---|---|
md5:6ebc77c9a9fe187f8f36185377932857
|
124.2 kB | Preview Download |
Additional details
- Eprint ID
- 28867
- Resolver ID
- CaltechAUTHORS:20120119-135511706
- CCR-9457811
- NSF Young Investigator Award
- Sloan Research Fellowship
- Defense Advanced Research Projects Agency (DARPA) BMDO NASA/OSAT
- Created
-
2012-01-19Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5848823