A Caltech Library Service

Diversity Coloring for information storage in networks

Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2002) Diversity Coloring for information storage in networks. In: 2002 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 381. ISBN 0-7803-7501-7.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


We propose a new file placement scheme using MDS codes, and formulate it as the diversity coloring Problem. We then present an optimal diversity coloring algorithm for trees.

Item Type:Book Section
Related URLs:
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2002 IEEE. Date of Current Version: 26 February 2004. This work was supported in part by the Lee Center for Advanced Networking at Caltech.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number7643706
Record Number:CaltechAUTHORS:20111019-133944822
Persistent URL:
Official Citation:Anxiao Jiang; Bruck, J.; , "Diversity coloring for information storage in networks," Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on , vol., no., pp. 381, 2002 doi: 10.1109/ISIT.2002.1023653 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:27311
Deposited By: Tony Diaz
Deposited On:19 Oct 2011 21:21
Last Modified:09 Nov 2021 16:47

Repository Staff Only: item control page