Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels with Glitches

Transmission across a bus modelled as a parallel asynchronous communication channel is subject to fault injection attacks which cause glitches-pulses that are added to the transmitted signal at arbitrary times-and delays. We present self-synchronizing coding schemes with no latency at the receiver that do not require any acknowledgment to be sent and that can decode the received signal even when the signal suffers from random delays and distortion by random glitches. We make use of the codes to produce lower bounds on the information capacity of such channels when the number of parallel channels is large.