This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors within a b-bit byte (1 ≤ l < b) and double asymmetric errors within a codeword. The presented codes are constructed with the help of a computer and have the potential to be used in unamplified optical networks. In addition, the paper derives the upper bound on code length and shows that the proposed codes are efficient in terms of redundancy.

中文翻译：

---

整数代码，用于纠正字节内的突发不对称和双不对称错误

本文介绍了一种类的能够校正的整数代码升一个内位突发错误不对称b比特字节（1≤ 升 <  b）和码字内双不对称的错误。所呈现的代码是在计算机的帮助下构建的，并且有可能在未放大的光网络中使用。此外，本文推导了代码长度的上限，并表明所提出的代码在冗余方面是有效的。