On the Efficiency of Berger Codes Against Error Injection Attacks on Parallel Asynchronous Communication Channels

ABSTRACTThe paper deals with the efficiency of Berger codes under error injection attacks. Berger codes are unordered codes; that is, they are insensitive to propagation delays of individual bits in a codeword. Berger codes are commonly used (in concatenation with linear codes) to provide reliable communication over parallel asynchronous channels. The paper examines the robustness of Berger codes under error injection attacks on the communication channels. It is shown that if the number of information bits is not equal to , where is the number of redundancy bits, then the Berger code is robust; that is, any injected error can be detected.