Fault-tolerant Distributed Decoding of Cyclic Block Codes
A.H. Murad, Thomas E. Fuja · 2005
Suppose one is given M (possibly corrupted) codewords from M (possibly different) codes, each over F/sub q/; suppose further that the codewords have a single symbol in common. The common-symbol decoding problem is that of estimating the symbol in the common position. In [1], a solution to this problem was presented for a very restricted case. This talk presents a general solution that contains the familiar one-step majority-logic decoding as a special case. This algorithm leads naturally to a decoder structure suitable for fault-tolerant decoding of cyclic block codes; the resulting architecture undergoes graceful degradation with increasing component failures. Bounds on decoder performance under various kinds of partial decoder failures are presented.