DocumentCode :
2060486
Title :
Diversity coloring for information storage in networks
Author :
Jiang, Anxiao Andrew ; Bruck, Jehoshua
Author_Institution :
California Inst. of Technol., Pasadena, CA, USA
fYear :
2002
fDate :
2002
Firstpage :
381
Abstract :
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.
Keywords :
encoding; file organisation; graph colouring; information storage; trees (mathematics); MDS codes; diversity coloring problem; file placement scheme; information storage; networks; optimal algorithm; trees; Costs; Decoding; Fault tolerance; Inspection; Intelligent networks; Joining processes; Parity check codes; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023653
Filename :
1023653
Link To Document :
بازگشت