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

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

筛选
英文 中文
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth 关于寻找具有少量短循环和大周长的二部图的计算复杂度
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989134
Ali Dehghan, A. Banihashemi
{"title":"On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth","authors":"Ali Dehghan, A. Banihashemi","doi":"10.1109/ITW44776.2019.8989134","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989134","url":null,"abstract":"The problem of finding bipartite (Tanner) graphs with given degree sequences that have large girth and few short cycles is of great interest in many applications including construction of good low-density parity-check (LDPC) codes. In this paper, we prove that for a given set of integers $alpha, beta$, and $gamma$, and degree sequences $pi$ and $pi$’, the problem of determining whether there exists a simple bipartite graph with degree sequences $(pi, pi')$ that has at most $alpha$ ($beta$ and $gamma$) cycles of length four (six and eight, respectively) is NP-complete. This is proved by a two-step polynomial-time reduction from the 3-Partition Problem. On the other hand, using connections to linear hypergraphs, we prove that given the degree sequence $pi$, a polynomial time algorithm can be devised to determine whether there exists a bipartite graph whose degree sequence on one side of the bipartition is $pi$ and has a girth of at least six.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122056136","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
Small stopping sets in projective low-density parity-check codes 投影低密度奇偶校验码中的小停止集
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989047
Yuichiro Fujiwara, Y. Tsunoda
{"title":"Small stopping sets in projective low-density parity-check codes","authors":"Yuichiro Fujiwara, Y. Tsunoda","doi":"10.1109/ITW44776.2019.8989047","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989047","url":null,"abstract":"It is known that redundant parity-check equations can improve the performance of an LDPC code by reducing the number of harmful substructures in the parity-check matrix. However, it is a difficult problem to design a parity-check matrix in such a way that it avoids substructures that are known to be harmful to iterative decoding while keeping the number of redundant parity-check equations moderate and ensuring other desirable properties. We explicitly give redundant parity-check matrices for cyclic regular LDPC codes of length n and minimum distance $d sim sqrt{n}$ in which there are only n parity-check equations but no stopping sets of size d+1 or smaller except for those that correspond to the nonzero codewords of the smallest weight. We do this by showing that the well-known projective LDPC codes from the incidence matrices of projective planes PG(2, q) with q even have this property. This result may give insight into how the small number of redundant parity-check equations in the geometric LDPC codes may be contributing to the good performance reported in the literature. We also give a slightly improved upper bound on the size of a smallest generic erasure correcting set.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126327250","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
Improved List Decoding of Polar Codes by Shifted-pruning 基于移位剪枝的改进极性码列表译码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989330
M. Rowshan, E. Viterbo
{"title":"Improved List Decoding of Polar Codes by Shifted-pruning","authors":"M. Rowshan, E. Viterbo","doi":"10.1109/ITW44776.2019.8989330","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989330","url":null,"abstract":"In successive cancellation list (SCL) decoding, the list pruning operation retains the L paths with highest likelihoods. However, the correct path might be among the paths with low likelihoods due to channel noise. In this case, the correct path is eliminated from the list. In this work, we study the event of elimination of the correct path and we analyze where and how this event occurs. A modified pruning scheme named shifted-pruning over a set of low-reliability bit-channels named critical bits is proposed aiming to avoid the elimination of the correct path in additional decoding attempts after a decoding failure occurs. Shifted-pruning is realized by selecting the paths k + 1 to k + L out of the 2L ordered paths instead of the paths 1 to L. The numerical results for polar codes of length 512 and code rates 0.5 and 0.8 and list sizes L = 2, 8 and 32 show that the shifted-pruning scheme is a low-complexity equivalent to the bit-flipping scheme while it can outperform the bit-flipping method by providing 0. 25-0.5dB gain.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909311","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}
引用次数: 19
The Additive Noise Channel with a Helper 加性噪声通道与助手
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989368
S. Bross, A. Lapidoth
{"title":"The Additive Noise Channel with a Helper","authors":"S. Bross, A. Lapidoth","doi":"10.1109/ITW44776.2019.8989368","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989368","url":null,"abstract":"The additive noise channel is studied in the presence of a helper who observes the noise and can describe it to the receiver over a rate-limited noise-free bit-pipe. It is shown that the capacity of this network is typically the sum of the capacity of the channel in the absence of the helper and the capacity of the bit-pipe from the helper to the receiver. This holds for finite-variance stationary and ergodic noises under fairly general power-like constraints on the transmitted signal. A helper that is only cognizant of the noise is thus as helpful as an omniscient helper that is cognizant of both the noise and the transmitted message. The achievability proof is based on “flash helping” and requires no binning. Extensions to additive-noise multi-access channels are also discussed.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421937","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}
引用次数: 7
On the continuity of the invariance entropy for hyperbolic linear control systems on Lie groups 李群上双曲型线性控制系统不变性熵的连续性
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989164
A. Silva
{"title":"On the continuity of the invariance entropy for hyperbolic linear control systems on Lie groups","authors":"A. Silva","doi":"10.1109/ITW44776.2019.8989164","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989164","url":null,"abstract":"In this paper we show that the invariance entropy of the chain control set associated with a hyperbolic linear control system on a connected Lie group is continuous with relation to the system parameters.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132638079","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
optimization of Nested Array-based LDPC Codes Via Spatial Coupling 基于空间耦合的嵌套数组LDPC代码优化
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989313
Salman Habib, David G. M. Mitchell, J. Kliewer
{"title":"optimization of Nested Array-based LDPC Codes Via Spatial Coupling","authors":"Salman Habib, David G. M. Mitchell, J. Kliewer","doi":"10.1109/ITW44776.2019.8989313","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989313","url":null,"abstract":"Linear nested codes, where two or more subcodes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled LDPC codes and propose a line-counting based optimization scheme for minimizing the number of dominant absorbing sets in order to improve its performance in the high signal-to-noise ratio regime. The presented multi-step optimization process is applied first to one of the nested codes, then an optimization of the remaining nested codes is carried out based on these code constraints. We also show that for certain code parameters, dominant absorbing sets in the Tanner graphs of all nested codes can be completely removed using our proposed optimization strategy.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134120255","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
Learning and Adaptive Data Analysis via Maximal Leakage 基于最大泄漏的学习与自适应数据分析
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989057
A. Esposito, M. Gastpar, Ibrahim Issa
{"title":"Learning and Adaptive Data Analysis via Maximal Leakage","authors":"A. Esposito, M. Gastpar, Ibrahim Issa","doi":"10.1109/ITW44776.2019.8989057","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989057","url":null,"abstract":"There has been growing interest in studying connections between generalization error of learning algorithms and information measures. In this work, we generalize a result that employs the maximal leakage, a measure of leakage of information, and explore how this bound can be applied in different scenarios. The main application can be found in bounding the generalization error. Rather than analyzing the expected error, we provide a concentration inequality. In this work, we do not require the assumption of $sigma $-sub gaussianity and show how our results can be used to retrieve a generalization of the classical bounds in adaptive scenarios (e.g., McDiarmid’s inequality for c–sensitive functions, false discovery error control via significance level, etc.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134409205","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 Capacity of Private Nonlinear Computation for Replicated Databases 复制数据库私有非线性计算能力研究
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989267
Sarah A. Obead, Hsuan-Yin Lin, E. Rosnes, J. Kliewer
{"title":"On the Capacity of Private Nonlinear Computation for Replicated Databases","authors":"Sarah A. Obead, Hsuan-Yin Lin, E. Rosnes, J. Kliewer","doi":"10.1109/ITW44776.2019.8989267","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989267","url":null,"abstract":"We consider the problem of private computation (PC) in a distributed storage system. In such a setting a user wishes to compute a function of f messages replicated across n noncolluding databases, while revealing no information about the desired function to the databases. We provide an information-theoretically accurate achievable PC rate, which is the ratio of the smallest desired amount of information and the total amount of downloaded information, for the scenario of nonlinear computation. For a large message size the rate equals the PC capacity, i.e., the maximum achievable PC rate, when the candidate functions are the f independent messages and one arbitrary nonlinear function of these. When the number of messages grows, the PC rate approaches an outer bound on the PC capacity. As a special case, we consider private monomial computation (PMC) and numerically compare the achievable PMC rate to the outer bound for a finite number of messages.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117290335","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
An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures 具有突发和任意擦除信道的最优流码的显式构造
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988926
Damian Dudzicz, S. Fong, A. Khisti
{"title":"An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures","authors":"Damian Dudzicz, S. Fong, A. Khisti","doi":"10.1109/ITW44776.2019.8988926","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988926","url":null,"abstract":"This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding window erasure model, with burst and arbitrary losses, introduced by Badr et al.. Recently, two independents works by Fong et al. and Krishnan and Kumar have identified optimal streaming codes within this framework. In this paper, we introduce streaming codes when the rate of the code is at least 1/2. Our proposed construction is explicit and systematic, uses off-the-shelf maximum distance separable (MDS) codes and maximum rank distance (MRD) Gabidulin block codes as constituent codes and achieves the optimal error correction. It presents a natural generalization to the construction of Martinian and Sundberg which tolerates an arbitrary number of sparse erasures. The field size requirement which depends on the constituent MDS and MRD codes is also analyzed.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115797130","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}
引用次数: 47
Multi-library Coded Caching with Partial Secrecy 部分保密的多库编码缓存
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989309
M. Sarkiss, M. Wigger
{"title":"Multi-library Coded Caching with Partial Secrecy","authors":"M. Sarkiss, M. Wigger","doi":"10.1109/ITW44776.2019.8989309","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989309","url":null,"abstract":"The paper considers a coded caching setup with two libraries and where only one of them needs to be kept secret from an external eavesdropper. We provide upper and lower bounds on the secrecy rate-memory tradeoff for systems with $mathsf{K}$ = 2 or $mathsf{K}$ = 3 receivers. Our bounds are tight in some regimes and show that the standard (non-secure) coded caching upper bound can be approached for a wide range of parameters. In some cases, the proposed upper bound on the secrecy rate-memory tradeoff is even lower than the lower bound for standard coded caching. The reason is that in our setup the ratio of receivers requesting secure files over those requesting nonsecure files is fixed and known to everyone in advance. The transmitter can thus adjust the contents stored in the cache memories to this ratio.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"38 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385800","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学术官方微信