This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Near-Perfect Codes for Binary-Coded Radix-r Arithmetic Units
May 1983 (vol. 32 no. 5)
pp. 494-497
N. Gaitanis, Digital Systems Laboratory, Computer Center, NRC "Democritos," Aghia Paraskevi
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, C. Halatsis, "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
Usage of this product signifies your acceptance of the Terms of Use.