Show simple item record

dc.creatorRadonjić, Aleksandar
dc.creatorVujičić, Vladimir
dc.date.accessioned2019-05-06T11:07:18Z
dc.date.available2020-04-01
dc.date.issued2019
dc.identifier.issn0974-780X
dc.identifier.issn0377-2063
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/03772063.2019.1593056
dc.identifier.urihttp://dais.sanu.ac.rs/123456789/5800
dc.description.abstractThis paper presents two types of integer codes capable of correcting burst asymmetric errors within a byte. The presented codes are constructed with the help of a computer and are very efficient in terms of redundancy. The results of a computer search have shown that, for practical data lengths up to 4096 bits, the presented codes use up to two check-bits less than the best burst asymmetric error correcting codes. Besides this, it is shown that the presented codes are suitable for implementation on modern processors.
dc.languageen
dc.publisherTaylor & Francis Group
dc.rightsembargoedAccess
dc.sourceIETE Journal of Research
dc.subjectinteger codes
dc.subjecterror correction
dc.subjectburst asymmetric errors
dc.subjectmulticore processors
dc.titleInteger Codes Correcting Burst Asymmetric Errors Within a Byte
dc.typearticleen
dc.rights.licenseBY-NC-ND
dcterms.abstractРадоњић, Aлександар; Вујичић, Владимир;
dc.citation.spage1
dc.citation.epage7
dc.identifier.wos000465688300001
dc.identifier.doi10.1080/03772063.2019.1593056
dc.identifier.scopus2-s2.0-85063803127
dc.type.versionacceptedVersion


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record