Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/9174
DC FieldValueLanguage
dc.contributor.authorRadonjić, Aleksandaren_US
dc.contributor.authorVujičić, Vladimiren_US
dc.date.accessioned2019-09-30T09:13:59Z-
dc.date.available2019-09-30T09:13:59Z-
dc.date.issued2013-01-02-
dc.identifier.issn00189340en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/9174-
dc.description.abstractThis paper presents a class of integer codes that can correct any burst of length ≤ l within a b-bit byte. Their main advantages lie in linear complexity of encoding and decoding procedures, as well as in the fact that a look-up table-based error control procedure requires relatively small memory resources. © 1968-2012 IEEE.en
dc.relation.ispartofIEEE Transactions on Computersen
dc.titleInteger codes correcting burst errors within a byteen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1109/TC.2011.243-
dc.identifier.scopus2-s2.0-84871656792-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84871656792-
dc.description.versionUnknownen_US
dc.relation.lastpage415en
dc.relation.firstpage411en
dc.relation.issue2en
dc.relation.volume62en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

26
checked on May 10, 2024

Page view(s)

15
Last Week
11
Last month
0
checked on May 3, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.