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.This is the peer reviewed version of the following article: Radonjic, A., Vujicic, V., 2019. Integer codes correcting burst asymmetric within a byte and double asymmetric errors. Cryptogr. Commun. [https://doi.org/10.1007/s12095-019-00388-0]The original version of this article unfortunately contained a mistake in the main title. Instead of “Integer codes correcting burst asymmetric within a byte and double asymmetric errors” the title should read “Integer codes correcting burst asymmetric errors within a byte and double asymmetric errors”. The correction: [https://doi.org/10.1007/s12095-019-00398-y]Published version: [https://hdl.handle.net/21.15107/rcub_dais_10030
