Error Correction for Cooperative Data Exchange
This paper considers the problem of error correction for a Co-operative Data Exchange (CDE) system, where some clients are compromised or failed and send false messages. Assuming each client possesses a subset of the total messages, they analyze the error correction capability when every client is allowed to broadcast only one linearly-coded message. Their error correction capability bound determines the maximum number of clients that can be compromised or failed without jeopardizing the final decoding solution at each client. They show that deterministic, feasible linear codes exist that can achieve the derived bound.