Multicluster interleaving on paths and cycles

  title={Multicluster interleaving on paths and cycles},
  author={Anxiao Jiang and Jehoshua Bruck},
  journal={IEEE Transactions on Information Theory},
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/spl ges/2) nonoverlapping clusters of order 2 in the path or cycle have at least three distinct integers… CONTINUE READING
8 Citations
16 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 16 references

Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes

  • K.A.S. Abdel-Ghaffar
  • Proc. IEEE Int. Symp. Information Theory , Ulm…
  • 1997
Highly Influential
5 Excerpts

Correcting two-dimensional clusters by interleaving of symbols

  • M. Blaum, J. Bruck
  • inProc. IEEE Int. Symp. Information Theory…
  • 1994
Highly Influential
6 Excerpts

Two-dimensional interleaving using the set partition technique

  • C. Almeida, R. Palazzo
  • inProc. IEEE Int. Symp. Information Theory…
  • 1994
Highly Influential
5 Excerpts

On the optimality of coloring with a lattice

  • Y. Merksamer, T. Etzion
  • Proc. IEEE Int. Symp. Inform. Theory , Chicago…
  • 2004
1 Excerpt

Diversity coloring for information storage in networks

  • A. Jiang, J. Bruck
  • Proc. IEEE Int. Symp. Inform. Theory , Lausanne…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…