Fixed-Length Strong Coordination

Giulia Cervia, T. Oechtering, M. Skoglund
{"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}
引用次数: 2

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.
定长强协调
研究了有限长度条件下噪声信道上信号和作用的联合分布的合成问题。对于固定的块长度n和距离$\varepsilon$的上界,提出了一种编码方案,使得诱导联合分布$\varepsilon$-在L1距离上接近目标i.i.d分布。当n趋于无穷时,可以从本文的主要结果中恢复出渐近强配位的可实现目标分布集和率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信