Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/47583
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Arslan S.S. | - |
dc.contributor.author | Haytaoglu E. | - |
dc.date.accessioned | 2023-01-09T21:29:18Z | - |
dc.date.available | 2023-01-09T21:29:18Z | - |
dc.date.issued | 2022 | - |
dc.identifier.isbn | 9781665421591 | - |
dc.identifier.issn | 2157-8095 | - |
dc.identifier.uri | https://doi.org/10.1109/ISIT50566.2022.9834714 | - |
dc.identifier.uri | https://hdl.handle.net/11499/47583 | - |
dc.description | 2022 IEEE International Symposium on Information Theory, ISIT 2022 -- 26 June 2022 through 1 July 2022 -- 181636 | en_US |
dc.description.abstract | Guessing a random variable with finite or countably infinite support in which each selection leads to a positive cost value has recently been studied within the context of "guessing cost". In those studies, similar to standard guesswork, upper and lower bounds for the ?-th moment of guessing cost are described in terms of the known measure Rényi's entropy. In this study, we non-trivially improve the known bounds using previous techniques along with new notions such as balancing cost. We have demonstrated that the novel lower bound proposed in this work, achieves 5.84%, 18.47% higher values than that of the known lower bound for ? = 1 and ? = 5, respectively. As for the upper bound, the novel expression provides 10.93%, 5.54% lower values than that of the previously presented bounds for ? = 1 and ? = 5, respectively. © 2022 IEEE. | en_US |
dc.description.sponsorship | Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK: 119E235 | en_US |
dc.description.sponsorship | *This work is supported by The Scientific and Technological Research Council of Turkey (TUBITAK) under grant number 119E235. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Cost values | en_US |
dc.subject | Low bound | en_US |
dc.subject | Renyi's entropy | en_US |
dc.subject | Upper and lower bounds | en_US |
dc.subject | Upper Bound | en_US |
dc.subject | Information theory | en_US |
dc.title | Improved Bounds on the Moments of Guessing Cost | en_US |
dc.type | Conference Object | en_US |
dc.identifier.volume | 2022-June | en_US |
dc.identifier.startpage | 3351 | en_US |
dc.identifier.endpage | 3356 | en_US |
dc.identifier.doi | 10.1109/ISIT50566.2022.9834714 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 35955672100 | - |
dc.authorscopusid | 55839391400 | - |
dc.identifier.scopus | 2-s2.0-85136264912 | en_US |
dc.identifier.scopusquality | - | - |
item.languageiso639-1 | en | - |
item.openairetype | Conference Object | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | 10.10. Computer Engineering | - |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.