DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mihaljević, Miodrag J. | en |
dc.contributor.author | Fossorier, Marc P. C. | en |
dc.contributor.author | Imai, Hideki | en |
dc.date.accessioned | 2020-03-05T20:28:25Z | - |
dc.date.available | 2020-03-05T20:28:25Z | - |
dc.date.issued | 2000-01-01 | en |
dc.identifier.issn | 2157-8095 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/143 | - |
dc.description.abstract | A powerful family of algorithms for the fast correlation attack [1] with significantly better performance, assuming the same inputs, than previously reported methods, is proposed. The family is based on the iterative decoding principle in conjunction with a novel method for constructing the parity-checks. | en |
dc.publisher | IEEE | - |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en |
dc.title | Novel fast correlation attacks via iterative decoding of punctured simplex codes | en |
dc.type | Article | en |
dc.identifier.doi | 10.1109/ISIT.2000.866512 | en |
dc.identifier.scopus | 2-s2.0-0034449342 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 214 | en |
dc.description.rank | M33 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.openairetype | Article | - |
item.cerifentitytype | Publications | - |
crisitem.author.orcid | 0000-0003-3047-3020 | - |
SCOPUSTM
Citations
2
checked on Oct 19, 2024
Page view(s)
11
checked on Oct 20, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.