Cart (Loading....) | Create Account
Close category search window
 

Arithmetic codes with large distance

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

1 Author(s)

Arithmetic codes are error-correcting or detecting codes implemented by ordinary arithmetic operations. Arithmetic codes with large distance, and therefore, capable of multierror correction are constructed. These codes are analogous to the finite field codes corresponding to maximal recurring sequences generated by shift registers whose characteristic polynomial is a primitive polynomial. These arithmetic codes are generated by the recurring sequence formed by the inverse of a prime having two as a primitive root. The distance as well as the redundancy increases with the code length. These codes have large redundancy but may be useful in specialized cases. Since the difference between a cyclic shift of a code word and the code word itself is another code word, a two-level function can be formed and the code used as an acquirable code. They can detect error bursts whose length is half the code length. A generalized burst-error correcting code is constructed and it is pointed out that the above large distance codes may be utilized in the construction of this burst-error code.

Published in:

Information Theory, IEEE Transactions on  (Volume:13 ,  Issue: 2 )

Date of Publication:

April 1967

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.