Diversity Coloring for Information Storage in Networks Conference Paper

abstract

• A file placement scheme using MDS codes was proposed and it was formulated as the diversity coloring problem. An optimal diversity coloring algorithm for trees was also presented. The scheme is to split the file into K equally long segments, and encode them using an (N,K) MDS code to generate N segments, then the file could be reconstructed by decoding any K of those N segments.

name of conference

• Proceedings IEEE International Symposium on Information Theory,

authors

• Jiang, Anxiao (Andrew)

published proceedings

• Proceedings IEEE International Symposium on Information Theory,

author list (cited authors)

• Jiang, A., & Bruck, J.

citation count

• 6

complete list of authors

• Jiang, Anxiao||Bruck, Jehoshua

publication date

• January 2002

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2002.1023653

start page

• 381

end page

• 381

URL

• http://dx.doi.org/10.1109/isit.2002.1023653