DocumentCode
1393446
Title
Interleave in peace, or interleave in pieces
Author
Beichl, I. ; Sullivan, Franklin
Author_Institution
Comput. & Appl. Math. Lab., Nat. Inst. of Stand. & Technol., Gaithersburg, MD
Volume
5
Issue
2
fYear
1998
Firstpage
92
Lastpage
96
Abstract
Bit interleaving is a technique that sometimes can collapse a problem of high dimensional data to one of lower dimensional data. Our favorite use is going from two or three dimensions to one dimension. Of course, you lose something in this process because 2D is not the same as 1D. There is no “reasonable” one-to-one mapping between the two spaces. But sometimes, what you lose isn´t all that important, and what you gain might make it worth doing. We show how we have used bit interleaving for two applications: finding the Hausdorff distance between sets (approximately) and calculating capacity dimension
Keywords
data compression; interleaved storage; set theory; Hausdorff distance; bit interleaving; capacity dimension; high dimensional data; lower dimensional data; set theory; Interleaved codes;
fLanguage
English
Journal_Title
Computational Science & Engineering, IEEE
Publisher
ieee
ISSN
1070-9924
Type
jour
DOI
10.1109/99.683746
Filename
683746
Link To Document