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

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

筛选
英文 中文
The Landscape of Security from Physical Assumptions1 从物理假设看安全图景
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611501
Alexander Koch
{"title":"The Landscape of Security from Physical Assumptions1","authors":"Alexander Koch","doi":"10.1109/ITW48936.2021.9611501","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611501","url":null,"abstract":"We survey several security assumptions based on physical principles as opposed to more common complexity-theoretic assumptions. This survey focuses on obtaining security guarantees via i) idealized hardware and ii) physical objects, and specifies how these assumptions have been used for devising cryptographic protocols, such as protocols for secure multi-party computation. Note that due to these assumptions, the protocols are often conceptually simpler, the security is independent of the computational power of an attacker, and the functioning and security is more transparent to humans.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"378 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":"131768699","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
Exact Recovery in the Balanced Stochastic Block Model with Side Information 带侧信息的平衡随机块模型的精确恢复
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611438
Jin Sima, Feng Zhao, Shao-Lun Huang
{"title":"Exact Recovery in the Balanced Stochastic Block Model with Side Information","authors":"Jin Sima, Feng Zhao, Shao-Lun Huang","doi":"10.1109/ITW48936.2021.9611438","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611438","url":null,"abstract":"The role that side information plays in improving the exact recovery threshold in the stochastic block model (SBM) has been studied in many aspects. This paper studies exact recovery in n node balanced binary symmetric SBM with side information, given in the form of $O(log n)$ i.i.d. samples at each node. A sharp exact recovery threshold is obtained and turns out to coincide with an existing threshold result, where no balanced constraint is imposed. Our main contribution is an efficient semi-definite programming (SDP) algorithm that achieves the optimal exact recovery threshold. Compared to the existing works on SDP algorithm for SBM with constant number of samples as side information, the challenge in this paper is to deal with the number of samples increasing in n.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"13 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":"114263779","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
New Dual Relationships for Error-Correcting Wiretap Codes 纠错窃听码的新对偶关系
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611443
M. Shoushtari, Willie K. Harrison
{"title":"New Dual Relationships for Error-Correcting Wiretap Codes","authors":"M. Shoushtari, Willie K. Harrison","doi":"10.1109/ITW48936.2021.9611443","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611443","url":null,"abstract":"In this paper, we consider the equivocation of finite blocklength coset codes when used over binary erasure wiretap channels. We make use of the equivocation matrix in comparing codes that are suitable for scenarios with noisy channels for both the intended receiver and an eavesdropper. Equivocation matrices have been studied in the past only for the binary erasure wiretap channel model with a noiseless channel for the intended recipient. In that case, an exact relationship between the elements of equivocation matrices for a code and its dual code was identified. The majority of work on coset codes for wiretap channels only addresses the noise-free main channel case, and extensions to noisy main channels require multi-edge type codes. In this paper, we supply a more insightful proof for the noiseless main channel case, and identify a new dual relationship that applies when two-edge type coset codes are used for the noisy main channel case. The end result is that the elements of the equivocation matrix for a dual code are known precisely from the equivocation matrix of the original code according to fixed reordering patterns. Such relationships allow one to study the equivocation of codes and their duals in tandem, which simplifies the search for best and/or good finite blocklength codes. This paper is the first work that succinctly links the equivocation/error correction capabilities of dual codes for two-edge type coset coding over erasure-prone main channels.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"3 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":"116178342","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
[ITW 2021 Front cover] [ITW 2021封面]
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/itw48936.2021.9611463
{"title":"[ITW 2021 Front cover]","authors":"","doi":"10.1109/itw48936.2021.9611463","DOIUrl":"https://doi.org/10.1109/itw48936.2021.9611463","url":null,"abstract":"","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"80 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":"129385294","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
A Reverse Jensen Inequality Result with Application to Mutual Information Estimation 一个逆Jensen不等式结果及其在互信息估计中的应用
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611449
G. Wunder, Benedikt Groß, Rick Fritschek, R. Schaefer
{"title":"A Reverse Jensen Inequality Result with Application to Mutual Information Estimation","authors":"G. Wunder, Benedikt Groß, Rick Fritschek, R. Schaefer","doi":"10.1109/ITW48936.2021.9611449","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611449","url":null,"abstract":"The Jensen inequality is a widely used tool in a multitude of fields, such as for example information theory and machine learning. It can be also used to derive other standard inequalities such as the inequality of arithmetic and geometric means or the Hölder inequality. In a probabilistic setting, the Jensen inequality describes the relationship between a convex function and the expected value. In this work, we want to look at the probabilistic setting from the reverse direction of the inequality. We show that under minimal constraints and with a proper scaling, the Jensen inequality can be reversed. We believe that the resulting tool can be helpful for many applications and provide a variational estimation of mutual information, where the reverse inequality leads to a new estimator with superior training behavior compared to current estimators.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"2 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":"128897537","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}
引用次数: 8
Sample-Efficient Learning of Cellular Antenna Parameter Settings 蜂窝天线参数设置的样本高效学习
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611420
Ezgi Tekgul, T. Novlan, S. Akoum, J. Andrews
{"title":"Sample-Efficient Learning of Cellular Antenna Parameter Settings","authors":"Ezgi Tekgul, T. Novlan, S. Akoum, J. Andrews","doi":"10.1109/ITW48936.2021.9611420","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611420","url":null,"abstract":"Finding an optimum configuration of base station (BS) antenna parameters is a challenging, non-convex problem for cellular networks. The chosen configuration has major implications for coverage and throughput in real-world systems, as it effects signal strength differently throughout the cell, as well as dictating the interference caused to other cells. In this paper, we propose a novel and sample-efficient data-driven methodology for optimizing antenna downtilt angles. Our approach combines Bayesian optimization (BO) with Differential Evolution (DE): BO decreases the computational burden of DE, while DE helps BO avoid the curse of dimensionality. We evaluate the performance on a realistic state-of-the-art cellular system simulator developed by AT&T Labs, that includes all layers of the protocol stack and sophisticated channel models. Our results show that the proposed algorithm outperforms Bayesian optimization, random selection, and the baseline settings adopted in 3GPP by nontrivial amounts in terms of both capacity and coverage. Also, our approach is notably more time-efficient than DE alone.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"62 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":"116017652","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}
引用次数: 4
On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems 两种存储系统的修复带宽和修复访问:大型统一机架感知存储系统
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611399
Zhengrui Li, Y. Han, Ting-Yi Wu, Hanxu Hou, Bo Bai, Gong Zhang
{"title":"On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems","authors":"Zhengrui Li, Y. Han, Ting-Yi Wu, Hanxu Hou, Bo Bai, Gong Zhang","doi":"10.1109/ITW48936.2021.9611399","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611399","url":null,"abstract":"In this paper, we consider two rack-aware storage systems. First, large-scale rack-aware storage system, which is very common in large-scale storage system, is a rack-aware storage system where all sizes of racks are at least the number of redundant nodes. For such storage system, we prove that any Maximum Distance Separable (MDS) codes can have optimal inter-rack repair bandwidth and give a closed-form representation of all repair schemes with optimal inter-rack repair bandwidth. Furthermore, we show that the optimal repair access and optimal inter-rack repair bandwidth can be attained simultaneously for such storage system. Second, we investigate the rack-aware storage system of all racks with the same size, which is called uniform rack-aware storage system. We prove that, except the trivial cases, we cannot attain optimal inter-rack repair bandwidth and optimal repair access for such storage system at the same time. Specifically, we establish the lower bound of repair access for a repair scheme with optimal interrack repair bandwidth, which is tight for some parameters, and also the tight lower bound of inter-rack repair bandwidth for a repair scheme with optimal repair access.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"70 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":"124402336","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
Generalized Universal Coding of Integers 整数的广义通用编码
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611436
Wei Yan, Sian-Jheng Lin
{"title":"Generalized Universal Coding of Integers","authors":"Wei Yan, Sian-Jheng Lin","doi":"10.1109/ITW48936.2021.9611436","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611436","url":null,"abstract":"Universal coding of integers (UCI) is a class of variable-length code, such that the ratio of the expected codeword length to $max{1, H( P)}$ is within a constant factor, where H(P) is the Shannon entropy of the decreasing probability distribution P. However, if we consider the ratio of the expected codeword length to H(P), the ratio tends to infinity by using UCI, when H(P) tends to zero. To solve this issue, this paper introduces a class of codes, termed generalized UCI, such that the ratio of the expected codeword length to H(P) is within a constant factor K. The definition of generalized UCI is proposed, and then the coding structure of generalized UCI is introduced. Finally, the asymptotically optimal generalized UCI is presented.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"74 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":"130726039","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
Analysis of Innovative Rank of Batched Network Codes for Wireless Relay Networks 无线中继网络批处理网络码创新秩分析
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611427
Hoover H. F. Yin, Xiaoli Xu, Ka Hei Ng, Y. Guan, R. Yeung
{"title":"Analysis of Innovative Rank of Batched Network Codes for Wireless Relay Networks","authors":"Hoover H. F. Yin, Xiaoli Xu, Ka Hei Ng, Y. Guan, R. Yeung","doi":"10.1109/ITW48936.2021.9611427","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611427","url":null,"abstract":"Wireless relay network is a solution for transmitting information from a source node to a sink node far away by installing a relay in between. The broadcasting nature of wireless communication allows the sink node to receive part of the data sent by the source node. In this way, the relay does not need to receive the whole piece of data from the source node and it does not need to forward everything it received. In this paper, we consider the application of batched network coding, a practical form of random linear network coding, for a better utilization of such a network. The amount of innovative information at the relay which is not yet received by the sink node, called the innovative rank, plays a crucial role in various applications including the design of the transmission scheme and the analysis of the throughput. We present a visualization of the innovative rank which allows us to understand and derive formulae related to the innovative rank with ease.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"33 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":"131408811","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
A recursive SISO decoding algorithm 一种递归SISO解码算法
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611446
Liudmila Karakchieva, P. Trifonov
{"title":"A recursive SISO decoding algorithm","authors":"Liudmila Karakchieva, P. Trifonov","doi":"10.1109/ITW48936.2021.9611446","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611446","url":null,"abstract":"A novel SISO decoding algorithm for linear block codes is presented. This algorithm is based on the recursive trellises and performs two passes over the recursion tree. Probabilitydomain implementation and its LogMax approximation are considered. Numeric results show that proposed method has lower complexity compared to the other known recursive algorithms and the classical BCJR algorithm.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"23 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":"131668250","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学术官方微信