Guessing Based on Compressed Side Information

Guessing Based on Compressed Side Information

A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-06
Hauptverfasser: Graczyk, Robert, Lapidoth, Amos, Neri Merhav, Pfister, Christoph
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Graczyk, Robert
Lapidoth, Amos
Neri Merhav
Pfister, Christoph
description A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2545787115</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2545787115</sourcerecordid><originalsourceid>FETCH-proquest_journals_25457871153</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdS9NLS7OzEtXcEosTk1RyM9TcM7PLSgCCgJ5wZkpqQqeeWn5RbmJJZn5eTwMrGmJOcWpvFCam0HZzTXE2UO3oCi_EGhQSXxWfmlRHlAq3sjUxNTcwtzQ0NSYOFUAopUxzQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2545787115</pqid></control><display><type>article</type><title>Guessing Based on Compressed Side Information</title><source>Open Access Journals</source><creator>Graczyk, Robert ; Lapidoth, Amos ; Neri Merhav ; Pfister, Christoph</creator><creatorcontrib>Graczyk, Robert ; Lapidoth, Amos ; Neri Merhav ; Pfister, Christoph</creatorcontrib><description>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><ispartof>arXiv.org, 2021-06</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Neri Merhav</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><title>Guessing Based on Compressed Side Information</title><title>arXiv.org</title><description>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.</description><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdS9NLS7OzEtXcEosTk1RyM9TcM7PLSgCCgJ5wZkpqQqeeWn5RbmJJZn5eTwMrGmJOcWpvFCam0HZzTXE2UO3oCi_EGhQSXxWfmlRHlAq3sjUxNTcwtzQ0NSYOFUAopUxzQ</recordid><startdate>20210624</startdate><enddate>20210624</enddate><creator>Graczyk, Robert</creator><creator>Lapidoth, Amos</creator><creator>Neri Merhav</creator><creator>Pfister, Christoph</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20210624</creationdate><title>Guessing Based on Compressed Side Information</title><author>Graczyk, Robert ; Lapidoth, Amos ; Neri Merhav ; Pfister, Christoph</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_25457871153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Neri Merhav</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Graczyk, Robert</au><au>Lapidoth, Amos</au><au>Neri Merhav</au><au>Pfister, Christoph</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Guessing Based on Compressed Side Information</atitle><jtitle>arXiv.org</jtitle><date>2021-06-24</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2545787115
source Open Access Journals
title Guessing Based on Compressed Side Information
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T20%3A50%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Guessing%20Based%20on%20Compressed%20Side%20Information&rft.jtitle=arXiv.org&rft.au=Graczyk,%20Robert&rft.date=2021-06-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2545787115%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2545787115&rft_id=info:pmid/&rfr_iscdi=true