Show simple item record

dc.creatorRadonjić, Aleksandar
dc.creatorVujićić, Vladimir
dc.date.accessioned2019-05-06T11:58:19Z
dc.date.available2020-01-12
dc.date.issued2019
dc.identifier.issn1936-2455
dc.identifier.urihttp://dais.sanu.ac.rs/123456789/5801
dc.description.abstractIn 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.
dc.languageen
dc.publisherSpringer
dc.rightsembargoedAccess
dc.sourceCryptography and Communications
dc.subjecterror correction
dc.subjectinteger codes
dc.subjectpublic optical networks
dc.subjectsparse byte errors
dc.titleInteger codes correcting sparse byte errors
dc.typearticleen
dc.rights.licenseBY-NC-ND
dcterms.abstractРадоњић, Aлександар; Вујићић, Владимир;
dc.identifier.doi10.1007/s12095-019-0350-9
dc.identifier.scopus2-s2.0-85070273413
dc.description.otherThis is the peer-revied version of the article: Radonjic, A., Vujicic, V., 2019. Integer codes correcting sparse byte errors. Cryptogr. Commun. [https://doi.org/10.1007/s12095-019-0350-9]
dc.type.versionacceptedVersion


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record