By Topic

On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)

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

2 Author(s)

In this correspondence we give a new definition of modular arithmetic weight (relative to any modulus m > 0 and any radix r \geq 2 ), which has two very useful properties, i) It is defined for all integers and is invariant under congruence modulo m . ii) It yields a metric for all moduli m . In the important cases m = r^n, m = r^n - 1 , and m = r^n + 1 , it coincides with the modular weight of Rao and Garcia, and thus acts as a proper measure of errors for these moduli. Due to these properties, we are able to obtain conceptually simpler proofs of several known (as well as some new) results on the computation of modular distance in cyclic AN-codes. Along these same lines we introduce the notion of modular-cyclic nonadjacent form (NAF) when m = r^n - 1 . For moduli of this type, we show that every integer has a modular-cyclic NAF; the number of nonzero digits is the modular weight. It is a curious fact that a "modular" version of the well-known Chang/Tsao-Wu algorithm (for computing the NAF) turns out to yield the modular-cyclic NAF directly.

Published in:

Information Theory, IEEE Transactions on  (Volume:20 ,  Issue: 6 )