Show simple item record

dc.creatorRadonjić, Aleksandar
dc.date.accessioned2018-09-06T10:04:17Z
dc.date.available2018-09-06T10:04:17Z
dc.date.issued2018
dc.identifier.issn1089-7798
dc.identifier.urihttp://dais.sanu.ac.rs/123456789/3753
dc.description.abstractThis letter presents a class of integer codes capable of correcting single errors. Unlike Hamming codes, the presented codes are constructed with the help of a computer. Among all codes of length up to 4096 bits, a computer search has found four perfect codes: (15, 10), (63, 56), (1023, 1012), and (4095, 4082). In addition, it is shown that, for practical data lengths up to 4096 bits, the proposed codes require only one check bit more compared to Hamming codes.
dc.publisherIEEE
dc.rightsrestrictedAccess
dc.sourceIEEE Communications Letters
dc.subjecterror correction
dc.subjectinteger codes
dc.subjectperfect codes
dc.subjectsingle errors
dc.title(Perfect) Integer Codes Correcting Single Errors
dc.typearticleen
dc.rights.licenseARR
dcterms.abstractРадоњић, Aлександар; (Перфецт) Интегер Цодес Цоррецтинг Сингле Еррорс;
dc.citation.spage17
dc.citation.epage20
dc.citation.volume22
dc.citation.issue1
dc.identifier.wos000422706100004
dc.identifier.doi10.1109/LCOMM.2017.2757465
dc.identifier.scopus2-s2.0-85031807207
dc.type.versionpublishedVersion


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record