Multicluster interleaving on paths and cycles

IEEE Transactions on Information Theory

Volumn 51, Issue 2, 2005, Pages 597-611

  Jiang, Anxiao Andrew ^a   Bruck, Jehoshua ^a  

^a California Institute of Technology   (United States)

Author keywords

Burst error; Cluster; Cycle; File placement; Interleaving; Multicluster interleaving (MCI); Path

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION;

BURST ERROR; CYCLE; FILE PLACEMENT; MULTICLUSTER INTERLEAVING (MCI); PATH;

CODES (SYMBOLS);

EID: 13444283760     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.840893     Document Type: Article

References (17)

1. K. A. S. Abdel-Ghaffar, "Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes," in Proc. IEEE Int. Symp. Information Theory, Ulm, Germany, 1997, p. 425.
2. C. Almeida and R. Palazzo, "Two-dimensional interleaving using the set partition technique," in Proc. IEEE Int. Symp. Information Theory Trondheim, Norway, 1994, p. 505.
3. M. Blaum and J. Bruck, "Correcting two-dimensional clusters by interleaving of symbols," in Proc. IEEE Int. Symp. Information Theory, Trondheim, Norway, 1994, p. 504.
4. M. Blaum, J. Bruck, and P. G. Farrell, "Two-dimensional interleaving schemes with repetitions," in Proc. IEEE Int. Symp. Information Theory, Ulm, Germany, 1997, p. 342.
5. M. Blaum, J. Bruck, and A. Vardy, "Interleaving schemes for multidimensional cluster errors," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 730-743, Mar. 1998.
6. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM'98, Vancouver, BC, Canada, Sep. 1998, pp. 56-67.
7. T. Etzion and A. Vardy, "Two-dimensional interleaving schemes with repetitions: Constructions and bounds," IEEE Trans. Inf Theory, vol. 48, no. 2, pp. 428-457, Feb. 2002.
8. K. Foltz, L. Xu, and J. Bruck, "Scheduling for efficient data broadcast over two channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 113.
9. A. Jiang and J. Bruck, "Diversity coloring for information storage in networks," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 381.
10. A. Jiang, M. Cook, and J. Bruck, "Optimal t-interleaving on tori," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 22.
11. A. Mahanti, D. L. Eager, M. K. Vernon, and D. Sundaram-Stukel, "Scalable on-demand media streaming with packet loss recovery," in Proc. ACM SIGCOMM'O1, San Diego, CA, Aug. 2001, pp. 97-108.
12. Y. Merksamer and T. Etzion, "On the optimality of coloring with a lattice," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 21.
13. M. Naor and R. M. Roth, "Optimal file sharing in distributed networks," SIAM J. Comput., vol. 24, no. 1, pp. 158-183, 1995.
14. D. A. Patterson, G. A. Gibson, and R. Katz, "A case for redundant arrays of inexpensive disks," in Proc. SIGMOD Int. Conf. Data Management, Chicago, IL, 1988, pp. 109-116.
15. M. Schwartz and T. Etzion, Optimal 2-Dimensional, 3-Dispersion Lattices (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003, vol. 2643, pp. 216-225.
16. A. Slivkins and J. Bruck, "Interleaving schemes on circulant graphs with two offsets," IEEE Trans. Inf. Theory, to be published.
17. W. Xu and S. W. Golomb, "Optimal interleaving schemes for correcting 2-D cluster errors," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL. Jun/Jul. 2004, p. 23.