发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size 多访问编码缓存中的最优速率内存权衡:大缓存大小
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161659
P. VijithKumarK., B. K. Rai, T. Jacob
{"title":"The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size","authors":"P. VijithKumarK., B. K. Rai, T. Jacob","doi":"10.1109/ITW55543.2023.10161659","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161659","url":null,"abstract":"In this paper, we consider the (N,K,L) multi-access caching network where K users and K caches are connected to a server with N files, each of size F bits, through a shared error-free broadcast channel. Each user has access to L nearby caches, each of size MF bits, in a cyclic wrap-around manner. Even after several previous attempts, the exact characterization of the optimal rate memory tradeoff is still an open problem except in the case where L = K − 1 and L = 1 with large cache $M in left[ {frac{N}{L} cdot frac{{K - 1}}{K},frac{N}{L}} right]$. This paper determines the optimal rate memory tradeoff for the cache network with L = K − 2 and $M in left[ {frac{N}{{K - 2}} cdot frac{{K - 1}}{K},frac{N}{{K - 2}}} right]$. This is done by proposing a new caching scheme that operates at the memory rate pair $left( {frac{N}{{K - 2}},frac{{K - 1}}{K},frac{1}{K}} right)$ and deriving a set of lower bounds to demonstrate the optimality of the scheme.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123654064","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}
引用次数: 1
Generalized low rank parity check codes 广义低秩奇偶校验码
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10160243
Ermes Franch, P. Gaborit, Chunlei Li
{"title":"Generalized low rank parity check codes","authors":"Ermes Franch, P. Gaborit, Chunlei Li","doi":"10.1109/ITW55543.2023.10160243","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10160243","url":null,"abstract":"In this work we propose a family of ${mathbb{F}_q}$-linear lowrank parity check (LRPC) codes based on a bilinear product over $mathbb{F}_q^m$ defined by a generic 3-tensor over ${mathbb{F}_q}$. A particular choice of this tensor corresponds to the classical ${mathbb{F}_{{q^m}}}$-linear LRPC codes; and other tensors yield ${mathbb{F}_q}$-linear codes, which, with some caveats, can be efficiently decoded with the same idea of decoding LRPC codes. The proposed codes contribute to the diversity of rank metric codes for cryptographic applications, particularly for the cases where attacks utilize ${mathbb{F}_{{q^m}}}$-linearity to reduce decoding complexity.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133713140","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
Fundamental Limits of Distributed Optimization over Multiple Access Channel 多址信道分布式优化的基本限制
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161622
Shubham K. Jha, Prathamesh Mayekar
{"title":"Fundamental Limits of Distributed Optimization over Multiple Access Channel","authors":"Shubham K. Jha, Prathamesh Mayekar","doi":"10.1109/ITW55543.2023.10161622","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161622","url":null,"abstract":"We consider distributed optimization over a d-dimensional space, where K remote clients send coded gradient estimates over an additive Gaussian Multiple Access Channel (MAC) with noise variance $sigma _z^2$. Furthermore, the codewords from the K clients must satisfy the average power constraint of P, resulting in a signal-to-noise ratio (SNR) of $KP/sigma _z^2$. In this paper, we study the fundamental limits imposed by MAC on the convergence rate of any distributed optimization algorithm and design optimal communication schemes to achieve these limits. Our first result is a lower bound for the convergence rate showing that compared to the centralized setting, communicating over a MAC imposes a slowdown of $sqrt {d/frac{1}{2}log (1 + {text{SNR}})}$ on any protocol. Next, we design a computationally tractable digital communication scheme that matches the lower bound to a logarithmic factor in K when combined with a projected stochastic gradient descent algorithm. At the heart of our communication scheme is a careful combination of several compression and modulation ideas such as quantizing along random bases, Wyner-Ziv compression, modulo-lattice decoding, and amplitude shift keying. We also show that analog coding schemes, which are popular due to their ease of implementation, can give close to optimal convergence rates at low SNR but experience a slowdown of roughly $sqrt d$ at high SNR.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307589","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
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions 奇维形式非模格的构造与保密增益
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10160234
M. F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
{"title":"Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions","authors":"M. F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus","doi":"10.1109/ITW55543.2023.10160234","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10160234","url":null,"abstract":"In contrast to binary codes, odd-length self-dual codes exist over the integers modulo 4. Lately, the use of lattices constructed from codes over ℤ4 to guarantee secure communication in a Gaussian wiretap channel was proposed and shown to exceed the performance of lattices from binary codes. This performance is measured regarding the secrecy gain, a criterion that depends on a lattice’s volume and theta series. Formally unimodular lattices, i.e., lattices with the same theta series as their dual, have presented promising results with respect to the secrecy gain. While previous contributions in the literature were mainly focused on even-dimensional lattices, this paper addresses the secrecy gain of odd-dimensional formally unimodular lattices obtained from codes over ℤ4, together with a novel construction of such codes.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467668","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}
引用次数: 1
Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders 双向会议解码器广播信道的容量界限
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161680
R. K. Farsani, Wei Yu
{"title":"Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders","authors":"R. K. Farsani, Wei Yu","doi":"10.1109/ITW55543.2023.10161680","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161680","url":null,"abstract":"The two-user broadcast channel (BC) with decoders connected by cooperative links of given capacities (known as conferencing decoders) is considered. A novel outer bound on the capacity region is established. This outer bound is derived using multiple applications of the Csiszár-Körner identity. A new achievable rate region for the channel is also presented which is derived by applying Marton’s coding as the transmission scheme, and quantize-bin-and-forward at one receiver and decode-and-forward at the other receiver as cooperative strategy. It is proved that the outer bound coincides with the achievable region for a class of semi-deterministic BCs with degraded message sets. This is the first capacity result for the two-user BC with bidirectional conferencing decoders. This result demonstrates that a one-round cooperation scheme is sufficient to achieve capacity for this class of semi-deterministic BCs with degraded message set. A capacity result is also derived for a new class of more capable semi-deterministic BCs with both common and private messages and one-sided conferencing.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"100 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123518695","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}
引用次数: 1
Retractable Commitment over Noisy Channels 噪声信道上的可伸缩承诺
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161683
Rémi A. Chou, M. Bloch
{"title":"Retractable Commitment over Noisy Channels","authors":"Rémi A. Chou, M. Bloch","doi":"10.1109/ITW55543.2023.10161683","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161683","url":null,"abstract":"Consider a commitment protocol between two parties, Alice and Bob, in which Alice may (i) commit to a message using a non-redundant discrete memoryless channel whose outputs are observed by Bob; and (ii) later reveal her committed message to Bob who must decide whether Alice is revealing the message she actually committed to. A commitment protocol should meet three standard requirements: concealment, bindingness, and soundness, to ensure that no party may act dishonestly. Our objective is to study whether one can enforce a fourth requirement that would allow Alice to retract a commitment before the reveal phase starts without Bob detecting that she ever participated in the commit phase of the protocol. We positively answer this question and characterize the commitment capacity for such a setting by relying on tools developed for covert communication.A full version of the paper is available at https://bloch.ece.gatech.edu/ITWretractablecommitment.pdf.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131838724","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
BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh Fading 基于BNNs和TISTA的瑞利衰落多址信道用户识别和信道估计签名码设计
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161674
L. Wei, Shan Lu, H. Kamabe
{"title":"BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh Fading","authors":"L. Wei, Shan Lu, H. Kamabe","doi":"10.1109/ITW55543.2023.10161674","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161674","url":null,"abstract":"User identification (UI) and channel estimation (CE) are essential in wireless networks with numerous users. Signature-code-based UI and CE schemes are widely used owing to their high spectral efficiency. Traditional signature code uses a discrete sensing matrix as a dictionary to generate codewords. Subsequently, the sparse vector recovery algorithm is used to recover the user state and channel state information in the received signal to complete the UI and CE. In this study, we propose an end-to-end machine-learning-aided signature code scheme under a multiple-access Rayleigh fading channel called machine-learning signature code (ML-SC). The ML-SC consists of a binarized-neural-networks-based (BNNs-based) trainable encoder and a trainable-iterative-soft-threshold-algorithm-based (TISTA-based) trainable decoder. To improve the accuracy, the dictionary is optimized by minimizing the mean squared error between the original and recovered information. Our proposed scheme achieved better performance and efficiency than the conventional schemes in the simulation. Moreover, it was confirmed that the dictionary generated by the ML-SC is suitable for various conventional decoders. Finally, by analyzing the results of the simulations, we found that ML-SC improves the restricted isometric constants and coherence of the dictionary.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116449885","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
Stability of Bernstein’s Characterization of Gaussian Vectors and a Soft Doubling Argument Bernstein高斯向量表征的稳定性及软倍增论证
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161689
Mohammad Mahdi Mahvari, G. Kramer
{"title":"Stability of Bernstein’s Characterization of Gaussian Vectors and a Soft Doubling Argument","authors":"Mohammad Mahdi Mahvari, G. Kramer","doi":"10.1109/ITW55543.2023.10161689","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161689","url":null,"abstract":"Stability properties of Bernstein’s characterization of Gaussian vectors are derived. Stability leads to a soft doubling argument through which one can prove capacity theorems without requiring the existence of capacity-achieving distributions.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132390121","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
Robustness of Massive MIMO to Location and Phase Errors 大规模MIMO对位置和相位误差的鲁棒性
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10160245
Elhamsadat Anarakifirooz, S. Loyka
{"title":"Robustness of Massive MIMO to Location and Phase Errors","authors":"Elhamsadat Anarakifirooz, S. Loyka","doi":"10.1109/ITW55543.2023.10160245","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10160245","url":null,"abstract":"The impact of random errors in element locations and beamforming phases on the performance of massive multipleinput multiple-output (MIMO) systems and their ability to cancel inter-user interference (IUI) are studied. For an arbitrary array geometry, user orthogonality, also known as “favorable propagation” (FP), is shown to hold asymptotically for the perturbed array as long as it holds for the unperturbed one, for independent (possibly non-Gaussian) errors. This means that small errors do not have catastrophic impact on the FP, even for a large number of antennas, and IUI can be reduced to any desired level. The negative impact of random errors is to slow down the convergence to the asymptotic value so that more antennas are needed under random errors to achieve the same low IUI as without errors. Practical design guidelines are given as to what implementation accuracy is needed to make the impact of random errors negligible and a closed-form estimate of IUI under random errors is presented. The analytical results are validated via numerical simulations and are in agreement with measurement-based studies.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092176","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
Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes 基于lll的交错中文剩余码译码器的概率分析
2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI: 10.1109/ITW55543.2023.10161639
Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, R. Lebreton
{"title":"Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes","authors":"Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, R. Lebreton","doi":"10.1109/ITW55543.2023.10161639","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161639","url":null,"abstract":"To date, Li et al. have presented the only decoder for Interleaved Chinese Remainder (ICR) codes [1]. The core of their ICR decoder is to find a short vector in a lattice using the LLL algorithm [2]. However, their analysis of the decoding failure is partially heuristic. In this work, we present a new analysis of their LLL-based decoder that gives a proved upper bound on its decoding failure probability.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512917","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信