Error propagation codes
Sulaiman Al-Bassam, Ramachandran Venkatesan · 1991
Anerror at bit i causes bits i, i+1, . . ., and i+m-1 (or up to the end of the word) to be in error, inflicting m consecutive errors. Ant-ec/d-ed code denotes a code which is able to correct any terrors and detect any derrors. The paper defines a new distance measure (similar to the Hamming distance) from which the necessary and sufficient conditions fort-ec/d-ed codes are obtained. To design such codes, a simple transformation between the t-ec/d-ed andt-ec/d-ed codes is introduced and a one-to-one map is established. The advantage of this map is two-fold. First, all the well-known t-ec/d-ed codes can be used ascodes and secondly the well-developed encoder/decoder circuits for the t-ec/d-ed codes along with a few XOR gates can be used to realize thet-ec/d-ed codes.<>