TY - GEN

T1 - Error Detection and Correction in Communication Networks

AU - Shangguan, Chong

AU - Tamo, Itzhak

N1 - Publisher Copyright:
© 2020 IEEE.

PY - 2020/6

Y1 - 2020/6

N2 - Let G be a connected graph on n vertices and C be an (n,k,d) code with d ≥ 2, defined on the alphabet {0,1}m. Suppose that for 1 ≤ i ≤ n, the i-th vertex of G holds an input symbol xi {0,1}m and let x = (x1,⋯,xn) {0,1}mn be the input vector formed by those symbols. Assume that each vertex of G can communicate with its neighbors by transmitting messages along the edges, and these vertices must decide deterministically, according to a predetermined communication protocol, that whether x C. Then what is the minimum communication cost to solve this problem? Moreover, if x C, say, there is less than \lfloor {(d - 1}\right)/2} \right\rfloor input errors among the xi's, then what is the minimum communication cost for error correction?We initiate the study of the two problems mentioned above. For the error detection problem, we obtain two lower bounds on the communication cost as functions of n,k,d,m, and our bounds are tight for several graphs and codes. For the error correction problem, we design a protocol which can efficiently correct a single input error when G is a cycle and C is a repetition code.

AB - Let G be a connected graph on n vertices and C be an (n,k,d) code with d ≥ 2, defined on the alphabet {0,1}m. Suppose that for 1 ≤ i ≤ n, the i-th vertex of G holds an input symbol xi {0,1}m and let x = (x1,⋯,xn) {0,1}mn be the input vector formed by those symbols. Assume that each vertex of G can communicate with its neighbors by transmitting messages along the edges, and these vertices must decide deterministically, according to a predetermined communication protocol, that whether x C. Then what is the minimum communication cost to solve this problem? Moreover, if x C, say, there is less than \lfloor {(d - 1}\right)/2} \right\rfloor input errors among the xi's, then what is the minimum communication cost for error correction?We initiate the study of the two problems mentioned above. For the error detection problem, we obtain two lower bounds on the communication cost as functions of n,k,d,m, and our bounds are tight for several graphs and codes. For the error correction problem, we design a protocol which can efficiently correct a single input error when G is a cycle and C is a repetition code.

UR - http://www.scopus.com/inward/record.url?scp=85090422758&partnerID=8YFLogxK

U2 - 10.1109/ISIT44484.2020.9174085

DO - 10.1109/ISIT44484.2020.9174085

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85090422758

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 96

EP - 101

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -