定长强协调

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI:10.1109/ITW44776.2019.8989338

Giulia Cervia, T. Oechtering, M. Skoglund

{"title":"定长强协调","authors":"Giulia Cervia, T. Oechtering, M. Skoglund","doi":"10.1109/ITW44776.2019.8989338","DOIUrl":null,"url":null,"abstract":"We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite length regime. For a fixed blocklength n and an upper bound on the distance $\\varepsilon$, a coding scheme is proposed such that the induced joint distribution is $\\varepsilon$-close in L1 distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having n that tends to infinity.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fixed-Length Strong Coordination\",\"authors\":\"Giulia Cervia, T. Oechtering, M. Skoglund\",\"doi\":\"10.1109/ITW44776.2019.8989338\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite length regime. For a fixed blocklength n and an upper bound on the distance $\\\\varepsilon$, a coding scheme is proposed such that the induced joint distribution is $\\\\varepsilon$-close in L1 distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having n that tends to infinity.\",\"PeriodicalId\":214379,\"journal\":{\"name\":\"2019 IEEE Information Theory Workshop (ITW)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW44776.2019.8989338\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW44776.2019.8989338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

研究了有限长度条件下噪声信道上信号和作用的联合分布的合成问题。对于固定的块长度n和距离$\varepsilon$的上界，提出了一种编码方案，使得诱导联合分布$\varepsilon$-在L1距离上接近目标i.i.d分布。当n趋于无穷时，可以从本文的主要结果中恢复出渐近强配位的可实现目标分布集和率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fixed-Length Strong Coordination

We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite length regime. For a fixed blocklength n and an upper bound on the distance $\varepsilon$, a coding scheme is proposed such that the induced joint distribution is $\varepsilon$-close in L1 distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having n that tends to infinity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 IEEE Information Theory Workshop (ITW)

自引率

0.00%

发文量