|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1983.1676261, author = {N. Gaitanis and C. Halatsis}, title = {Near-Perfect Codes for Binary-Coded Radix-r Arithmetic Units}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {5}, issn = {0018-9340}, year = {1983}, pages = {494-497}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676261}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Near-Perfect Codes for Binary-Coded Radix-r Arithmetic Units IS - 5 SN - 0018-9340 SP494 EP497 EPD - 494-497 A1 - N. Gaitanis, A1 - C. Halatsis, PY - 1983 KW - error-correcting codes KW - AN codes KW - arithmetic codes KW - binary-coded radix-r arithmetic VL - 32 JA - IEEE Transactions on Computers ER - | |||
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.

