DocumentCode :
2620528
Title :
Comparing multiple file copies using minimal communication
Author :
Abdel-Ghaffar, Khaled A S ; El Abbadi, Amr
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
171
Abstract :
The minimum amount of communication necessary to identify any given number of erroneous pages among the copies of a file is determined and a technique to attain this minimum is presented. We study the general case of identifying all corrupted pager among any number of secondary sites. We assume that secondary sites can communicate only with the primary site. We present a protocol that identifies the corrupted pages and prove that this protocol is optimal in the sense of requiring the minimum amount of communication. This protocol relies on the structure of Reed-Solomon codes
Keywords :
Reed-Solomon codes; error detection codes; file organisation; protocols; Reed-Solomon codes; erroneous pages identification; minimal communication; multiple file copies; primary site; protocol; secondary sites; Encoding; Protection; Protocols; Reed-Solomon codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.394801
Filename :
394801
Link To Document :
بازگشت