By Topic

On majority-logic-decodable arithmetic codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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 anL-step majority-logic decoding scheme is developed for the extended class of codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )