The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1983 vol.32)
pp: 494-497
N. Gaitanis , Digital Systems Laboratory, Computer Center, NRC "Democritos," Aghia Paraskevi
ABSTRACT
This paper considers AN arithmetic codes with radix r > 2 and binary-coded digits (BCr) using weights. The error-correcting capability of the AN codes is single bit within any BCr digit, that is, the corrected errors are of the form ? wirj where wi are the weights of the BCr code. The paper characterizes a class of AN codes having a generator of the form A = r ? p where r|r - 1 or t|r + 1 and p prime is greater than r - 1 or r + 1. It is shown that these codes, under certain conditions, are near perfect.
INDEX TERMS
error-correcting codes, AN codes, arithmetic codes, binary-coded radix-r arithmetic
CITATION
N. Gaitanis, "Near-Perfect Codes for Binary-Coded Radix-r Arithmetic Units", IEEE Transactions on Computers, vol.32, no. 5, pp. 494-497, May 1983, doi:10.1109/TC.1983.1676261
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool