Integer codes correcting burst asymmetric within a byte and double asymmetric errors
Abstract
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.
Keywords:
error correction / integer codes / asymmetric errors / optical networks / theoretical decoding throughputSource:
Cryptography and Communications, 2020, 12, 221-230Publisher:
- Springer
Note:
- 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
- Peer-reviewed manuscript: https://hdl.handle.net/21.15107/rcub_dais_6465
Related info:
DOI: 10.1007/s12095-019-00388-0
ISSN: 1936-2455; 1936-2447
WoS: 000519570000004
Scopus: 2-s2.0-85070330231
Institution/Community
Институт техничких наука САНУ / Institute of Technical Sciences of SASATY - JOUR AU - Radonjić, Aleksandar AU - Vujičić, Vladimir PY - 2020 UR - https://dais.sanu.ac.rs/123456789/10030 AB - 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. PB - Springer T2 - Cryptography and Communications T1 - Integer codes correcting burst asymmetric within a byte and double asymmetric errors SP - 221 EP - 230 VL - 12 DO - 10.1007/s12095-019-00388-0 UR - https://hdl.handle.net/21.15107/rcub_dais_10030 ER -
@article{ author = "Radonjić, Aleksandar and Vujičić, Vladimir", year = "2020", abstract = "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.", publisher = "Springer", journal = "Cryptography and Communications", title = "Integer codes correcting burst asymmetric within a byte and double asymmetric errors", pages = "221-230", volume = "12", doi = "10.1007/s12095-019-00388-0", url = "https://hdl.handle.net/21.15107/rcub_dais_10030" }
Radonjić, A.,& Vujičić, V.. (2020). Integer codes correcting burst asymmetric within a byte and double asymmetric errors. in Cryptography and Communications Springer., 12, 221-230. https://doi.org/10.1007/s12095-019-00388-0 https://hdl.handle.net/21.15107/rcub_dais_10030
Radonjić A, Vujičić V. Integer codes correcting burst asymmetric within a byte and double asymmetric errors. in Cryptography and Communications. 2020;12:221-230. doi:10.1007/s12095-019-00388-0 https://hdl.handle.net/21.15107/rcub_dais_10030 .
Radonjić, Aleksandar, Vujičić, Vladimir, "Integer codes correcting burst asymmetric within a byte and double asymmetric errors" in Cryptography and Communications, 12 (2020):221-230, https://doi.org/10.1007/s12095-019-00388-0 ., https://hdl.handle.net/21.15107/rcub_dais_10030 .