In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs). The reason for this is to avoid long strings of ones or zeros, which might affect the receiver synchronization. Unfortunately, the use of SSSs is always related to the problem of duplication of channel errors. More precisely, each error occurring during the transmission will be duplicated u bits later. In this paper, we present a low-cost solution to this problem based on integer codes capable of correcting sparse byte errors.
Cryptography and Communications, 2019, 11, 1069-1077
Publisher:
Springer
Note:
This is the peer-reviewed version of the article: Radonjic, A., Vujicic, V., 2019. Integer codes correcting sparse byte errors. Cryptogr. Commun. 11, 1069–1077. https://doi.org/10.1007/s12095-019-0350-9
TY - JOUR
AU - Radonjić, Aleksandar
AU - Vujićić, Vladimir
PY - 2019
UR - https://dais.sanu.ac.rs/123456789/5801
AB - In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs). The reason for this is to avoid long strings of ones or zeros, which might affect the receiver synchronization. Unfortunately, the use of SSSs is always related to the problem of duplication of channel errors. More precisely, each error occurring during the transmission will be duplicated u bits later. In this paper, we present a low-cost solution to this problem based on integer codes capable of correcting sparse byte errors.
PB - Springer
T2 - Cryptography and Communications
T1 - Integer codes correcting sparse byte errors
SP - 1069
EP - 1077
VL - 11
DO - 10.1007/s12095-019-0350-9
UR - https://hdl.handle.net/21.15107/rcub_dais_5801
ER -
@article{
author = "Radonjić, Aleksandar and Vujićić, Vladimir",
year = "2019",
abstract = "In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs). The reason for this is to avoid long strings of ones or zeros, which might affect the receiver synchronization. Unfortunately, the use of SSSs is always related to the problem of duplication of channel errors. More precisely, each error occurring during the transmission will be duplicated u bits later. In this paper, we present a low-cost solution to this problem based on integer codes capable of correcting sparse byte errors.",
publisher = "Springer",
journal = "Cryptography and Communications",
title = "Integer codes correcting sparse byte errors",
pages = "1069-1077",
volume = "11",
doi = "10.1007/s12095-019-0350-9",
url = "https://hdl.handle.net/21.15107/rcub_dais_5801"
}
Radonjić, A.,& Vujićić, V.. (2019). Integer codes correcting sparse byte errors. in Cryptography and Communications
Springer., 11, 1069-1077.
https://doi.org/10.1007/s12095-019-0350-9
https://hdl.handle.net/21.15107/rcub_dais_5801
Radonjić A, Vujićić V. Integer codes correcting sparse byte errors. in Cryptography and Communications. 2019;11:1069-1077.
doi:10.1007/s12095-019-0350-9
https://hdl.handle.net/21.15107/rcub_dais_5801 .
Radonjić, Aleksandar, Vujićić, Vladimir, "Integer codes correcting sparse byte errors" in Cryptography and Communications, 11 (2019):1069-1077,
https://doi.org/10.1007/s12095-019-0350-9 .,
https://hdl.handle.net/21.15107/rcub_dais_5801 .
