Multicluster Interleaving on Paths and Cycles Academic Article

abstract

• Interleaving codewords is an important method not only for combatting burst errors, but also for distributed data retrieval. This paper introduces the concept of multicluster interleaving (MCI), a generalization of traditional interleaving problems. MCI problems for paths and cycles are studied. The following problem is solved: how to interleave integers on a path or cycle such that any m (m 2) nonoverlapping clusters of order 2 in the path or cycle have at least three distinct integers. We then present a scheme using a "hierarchical-chain structure" to solve the following more general problem for paths: how to interleave integers on a path such that any m (m 2) nonoverlapping clusters of order L (L 2) in the path have at least L+1 distinct integers. It is shown that the scheme solves the second interleaving problem for paths that are asymptotically as long as the longest path on which an MCI exists, and clearly, for shorter paths as well. 2005 IEEE.

authors

• Jiang, Anxiao (Andrew)

published proceedings

• IEEE Transactions on Information Theory

author list (cited authors)

• Jiang, A., & Bruck, J.

citation count

• 10

complete list of authors

• Jiang, A||Bruck, J

publication date

• February 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

Digital Object Identifier (DOI)

• 10.1109/tit.2004.840893

start page

• 597

end page

• 611

volume

• 51

issue

• 2

URL

• http://dx.doi.org/10.1109/tit.2004.840893