Integer codes correcting burst and random asymmetric errors within a byte
Abstract
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. However, in some optical networks, such as local and access networks, this is not the case. In these networks, the number of received photons never exceeds the number of transmitted ones. Hence, if the receiver operates correctly, only 1 → 0 errors can occur. Motivated by this fact, in this paper, we present a class of integer codes capable of correcting burst and random asymmetric (1 → 0) errors within a b-bit byte. Unlike classical codes, the proposed codes are defined over the ring of integers modulo 2b −1. As a result, they have the potential to be implemented in software without any hardware assist.
Keywords:
communication networks / integer codes / burst and random asymmetric errorsSource:
Journal of the Franklin Institute, 2018, 355, 2, 981-996Publisher:
- Elsevier
Note:
- Peer-reviewed manuscript: https://hdl.handle.net/21.15107/rcub_dais_8972
DOI: 10.1016/j.jfranklin.2017.11.033
ISSN: 0016-0032
WoS: 000425496700018
Scopus: 2-s2.0-85039561362
URI
http://www.sciencedirect.com/science/article/pii/S0016003217306221https://dais.sanu.ac.rs/123456789/8971
Institution/Community
Институт техничких наука САНУ / Institute of Technical Sciences of SASATY - JOUR AU - Radonjić, Aleksandar AU - Vujičić, Vladimir PY - 2018 UR - http://www.sciencedirect.com/science/article/pii/S0016003217306221 UR - https://dais.sanu.ac.rs/123456789/8971 AB - In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. However, in some optical networks, such as local and access networks, this is not the case. In these networks, the number of received photons never exceeds the number of transmitted ones. Hence, if the receiver operates correctly, only 1 → 0 errors can occur. Motivated by this fact, in this paper, we present a class of integer codes capable of correcting burst and random asymmetric (1 → 0) errors within a b-bit byte. Unlike classical codes, the proposed codes are defined over the ring of integers modulo 2b −1. As a result, they have the potential to be implemented in software without any hardware assist. PB - Elsevier T2 - Journal of the Franklin Institute T1 - Integer codes correcting burst and random asymmetric errors within a byte SP - 981 EP - 996 VL - 355 IS - 2 DO - 10.1016/j.jfranklin.2017.11.033 UR - https://hdl.handle.net/21.15107/rcub_dais_8971 ER -
@article{ author = "Radonjić, Aleksandar and Vujičić, Vladimir", year = "2018", abstract = "In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. However, in some optical networks, such as local and access networks, this is not the case. In these networks, the number of received photons never exceeds the number of transmitted ones. Hence, if the receiver operates correctly, only 1 → 0 errors can occur. Motivated by this fact, in this paper, we present a class of integer codes capable of correcting burst and random asymmetric (1 → 0) errors within a b-bit byte. Unlike classical codes, the proposed codes are defined over the ring of integers modulo 2b −1. As a result, they have the potential to be implemented in software without any hardware assist.", publisher = "Elsevier", journal = "Journal of the Franklin Institute", title = "Integer codes correcting burst and random asymmetric errors within a byte", pages = "981-996", volume = "355", number = "2", doi = "10.1016/j.jfranklin.2017.11.033", url = "https://hdl.handle.net/21.15107/rcub_dais_8971" }
Radonjić, A.,& Vujičić, V.. (2018). Integer codes correcting burst and random asymmetric errors within a byte. in Journal of the Franklin Institute Elsevier., 355(2), 981-996. https://doi.org/10.1016/j.jfranklin.2017.11.033 https://hdl.handle.net/21.15107/rcub_dais_8971
Radonjić A, Vujičić V. Integer codes correcting burst and random asymmetric errors within a byte. in Journal of the Franklin Institute. 2018;355(2):981-996. doi:10.1016/j.jfranklin.2017.11.033 https://hdl.handle.net/21.15107/rcub_dais_8971 .
Radonjić, Aleksandar, Vujičić, Vladimir, "Integer codes correcting burst and random asymmetric errors within a byte" in Journal of the Franklin Institute, 355, no. 2 (2018):981-996, https://doi.org/10.1016/j.jfranklin.2017.11.033 ., https://hdl.handle.net/21.15107/rcub_dais_8971 .