This paper presents a class of integer codes capable of correcting single asymmetric errors. The presented codes are defined over the ring of integers modulo 2^b– 1 and are constructed with the help of a computer. The results of an exhaustive search have shown that, for practical lengths up to 4096 bits, the proposed codes use the same number of check bits as the best systematic single asymmetric error-correcting codes (SAECCs). Besides this, it is found that for some lengths the presented codes are perfect. Finally, the paper shows that the encoding/decoding complexity of the proposed codes is notably lower than that of the best systematic SAECCs.

中文翻译：

---

整数代码纠正单个非对称错误

本文提出了一类能够纠正单个非对称误差的整数代码。所显示的代码是在以2 ^b – 1为模的整数环上定义的，并借助计算机来构造。详尽搜索的结果表明，对于实际长度不超过4096位的代码，建议的代码使用的校验位数量与最佳系统单一非对称纠错码（SAECC）相同。除此之外，发现所给出的代码在某些长度上是完美的。最后，本文表明，所提出的编码的编码/解码复杂度明显低于最佳系统SAECC。