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
Hauptverfasser: Graczyk, Robert, Lapidoth, Amos, Merhav, Neri, Pfister, Christoph
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Graczyk, Robert
Lapidoth, Amos
Merhav, Neri
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.
doi_str_mv 10.48550/arxiv.2106.13341
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2106_13341</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2106_13341</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-89f3351181e17e6d8147027b2fa0170b186078220a25eb8eb1d4c3335ba852a93</originalsourceid><addsrcrecordid>eNotjssOgjAURLtxYdAPcCU_APa2lJalEh8kJC5kT26lmCbySFGjfy8-VpOZ5EwOIQugYaSEoCt0T_sIGdA4BM4jmJJgfzfDYNuLv8HBVH7X-mnX9G4cx3aylfGztu5cgzfbtTMyqfE6mPk_PVLstkV6CPLjPkvXeYCxhEAlNecCQIEBaeJKQSQpk5rVSEFSDSqmUjFGkQmjldFQRWc-IhqVYJhwjyx_t1_fsne2QfcqP97l15u_AbmKOys</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Guessing Based on Compressed Side Information</title><source>arXiv.org</source><creator>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; Pfister, Christoph</creator><creatorcontrib>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; 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>DOI: 10.48550/arxiv.2106.13341</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2021-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</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>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2106.13341$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2106.13341$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Merhav, Neri</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><title>Guessing Based on Compressed Side Information</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><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjssOgjAURLtxYdAPcCU_APa2lJalEh8kJC5kT26lmCbySFGjfy8-VpOZ5EwOIQugYaSEoCt0T_sIGdA4BM4jmJJgfzfDYNuLv8HBVH7X-mnX9G4cx3aylfGztu5cgzfbtTMyqfE6mPk_PVLstkV6CPLjPkvXeYCxhEAlNecCQIEBaeJKQSQpk5rVSEFSDSqmUjFGkQmjldFQRWc-IhqVYJhwjyx_t1_fsne2QfcqP97l15u_AbmKOys</recordid><startdate>20210624</startdate><enddate>20210624</enddate><creator>Graczyk, Robert</creator><creator>Lapidoth, Amos</creator><creator>Merhav, Neri</creator><creator>Pfister, Christoph</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210624</creationdate><title>Guessing Based on Compressed Side Information</title><author>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; Pfister, Christoph</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-89f3351181e17e6d8147027b2fa0170b186078220a25eb8eb1d4c3335ba852a93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Merhav, Neri</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Graczyk, Robert</au><au>Lapidoth, Amos</au><au>Merhav, Neri</au><au>Pfister, Christoph</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Guessing Based on Compressed Side Information</atitle><date>2021-06-24</date><risdate>2021</risdate><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><doi>10.48550/arxiv.2106.13341</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2106.13341
ispartof
issn
language eng
recordid cdi_arxiv_primary_2106_13341
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
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-02-05T09%3A15%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Guessing%20Based%20on%20Compressed%20Side%20Information&rft.au=Graczyk,%20Robert&rft.date=2021-06-24&rft_id=info:doi/10.48550/arxiv.2106.13341&rft_dat=%3Carxiv_GOX%3E2106_13341%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true