On majority-logic-decodable arithmetic codes

A new class of cyclic multiple-error-correcting arithmetic codes is described, and the minimum distance of these codes is determined analytically. A two-step majority-logic decoding scheme is developed for these arithmetic codes. The new class of codes is extended to a new class of arithmetic codes having a primitive cyclotomic factor as the generator and an -step majority-logic decoding scheme is developed for the extended class of codes.