2021 IEEE Information Theory Workshop (ITW)最新文献

A Study on the Joint Source-Channel Coding for Computing Functions: An Approach from a Dichotomy of Functions 计算函数的联合源信道编码研究:一种基于函数二分法的方法

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611408

Naruki Joki, S. Kuzuoka

引用次数: 0

Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels 嵌套稀疏反馈代码点对点，多址，和随机接入信道

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611385

Recep Can Yavas, V. Kostina, M. Effros

{"title":"Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels","authors":"Recep Can Yavas, V. Kostina, M. Effros","doi":"10.1109/ITW48936.2021.9611385","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611385","url":null,"abstract":"This paper investigates variable-length feedback codes for discrete memoryless channels in point-to-point, multiple access, and random access communication. The proposed nested code employs L decoding times $n_{1}, n_{2}, ldots, n_{L}$ for the point-to-point and multiple access channels and KL decoding times $left{n_{k, ell}: 1 leq k leq K, 1 leq ell leq Lright}$ for the random access channel with at most K active transmitters; in the latter case, decoding times $n_{k, ell}, 1 leq ell leq L$ are reserved for decoding in the scenario where the decoder believes that the number of active transmitters is k. The code has a nested structure, i.e., codewords used to decode messages from k active transmitters are prefix of codewords used to decode messages from $k+1$ active transmitters. The code employs single-bit, scheduled feedback from the receiver to the transmitters at each potential decoding time to inform the transmitters whether or not it is able to decode. Transmitters cease transmission, thereby truncating their codewords, when no further transmissions are required by the decoder. The choice of decoding times is optimized to minimize the expected decoding time subject to an error probability constraint, and second order achievability bounds are derived.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124931741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the Commitment Capacity of Reverse Elastic Channels 逆向弹性通道的承诺能力研究

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611485

Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav

{"title":"On the Commitment Capacity of Reverse Elastic Channels","authors":"Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav","doi":"10.1109/ITW48936.2021.9611485","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611485","url":null,"abstract":"In this work, we study commitment over a class of channels called reverse elastic channels (RECs). In the commitment problem, two mutually distrustful parties, say Alice and Bob, seek to commit on a bit string available to Alice. The parties interact via a commitment protocol comprising two phases, viz., commit phase followed by reveal phase. Alice commits to a string, and transmits it to Bob securely in a manner Bob cannot learn it until Alice chooses to reveal it; at the time of reveal, however, Bob can successfully detect if Alice cheats. It is well known that noisy channels are a promising resource to realize information-theoretically secure commitment; however, oftentimes, channel behaviour may be poorly characterized thereby limiting the commitment throughput and/or degrading the security guarantees. Particularly problematic is a scenario where dishonest parties can actively alter the channel characteristics. RECs are an interesting class of such unreliable channels, where essentially only a dishonest committer Alice can meaningfully alter the channel; RECs have attracted active recent interest. Our principal contribution is the REC commitment capacity characterization for all parameters; this proves a recent related conjecture. Apart from presenting an achievable scheme, a key result in our work is a tight converse which analyses a specific cheating strategy by Alice. The significance of RECs stems from the fact that along with elastic channels (ECs), where only a dishonest receiver Bob can alter the channel, these two channel models represent special cases of the more widely studied unfair noisy channels (UNCs). Interestingly, for a given set of parameters, our result shows that the REC commitment capacity is no larger than that for the ECs. Furthermore, similar to the ECs, RECs offer non-trivial commitment throughput for all meaningful parameters; this is in stark contrast to UNCs where the throughput may possibly be zero.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125954049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

STAR+ Codes: Triple-Fault-Tolerant Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding STAR+码:具有渐进最优更新和高效编码/解码的三容错码

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611512

Hanxu Hou, Patrick Lee

引用次数: 5

Strong Converse for Distributed Source Coding with Encryption Using Correlated Keys 使用相关密钥加密的分布式源编码的强逆

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611414

Y. Oohama, Bagus Santoso

引用次数: 0

ITW2021 Organizing Committee ITW2021组委会

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/itw48936.2021.9611455

引用次数: 0

Sparse Recovery Guarantees of Periodic Signals with Nested Periodic Dictionaries 嵌套周期字典下周期信号的稀疏恢复保证

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611507

Pouria Saidi, George K. Atia

引用次数: 2

[Copyright notice] (版权)

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/itw48936.2021.9611475

引用次数: 0

Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback 带反馈的广播包擦除信道的最优有限长度线性码及其信道色散

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611386

Shih-Chun Lin, Yi-Chun Lai, Yu-Chih Huang, Chih-Chun Wang, I-Hsiang Wang

{"title":"Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback","authors":"Shih-Chun Lin, Yi-Chun Lai, Yu-Chih Huang, Chih-Chun Wang, I-Hsiang Wang","doi":"10.1109/ITW48936.2021.9611386","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611386","url":null,"abstract":"With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115951894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Information Leakage in Index Coding 索引编码中的信息泄漏

2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611514

Yucheng Liu, L. Ong, Phee Lep Yeoh, P. Sadeghi, Joerg Kliewer, Sarah J. Johnson

引用次数: 2