DocumentCode
1148692
Title
Near-Perfect Codes for Binary-Coded Radix-r Arithmetic Units
Author
Gaitanis, N. ; Halatsis, C.
Author_Institution
Digital Systems Laboratory, Computer Center, NRC "Democritos," Aghia Paraskevi
Issue
5
fYear
1983
fDate
5/1/1983 12:00:00 AM
Firstpage
494
Lastpage
497
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 τ|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.
Keywords
AN codes; arithmetic codes; binary-coded radix-r arithmetic; error-correcting codes; Arithmetic; Automata; Character generation; Circuit synthesis; Cranes; Error correction codes; Image coding; Image communication; Information processing; Switching circuits; AN codes; arithmetic codes; binary-coded radix-r arithmetic; error-correcting codes;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676261
Filename
1676261
Link To Document