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

2019 IEEE International Symposium on Information Theory (ISIT)最新文献

筛选
英文 中文
Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes 改进极化码连续对消译码性能的回溯和前瞻译码算法
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849803
Myna Vajha, V. S. C. Mukka, P. V. Kumar
{"title":"Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes","authors":"Myna Vajha, V. S. C. Mukka, P. V. Kumar","doi":"10.1109/ISIT.2019.8849803","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849803","url":null,"abstract":"In [1], Arıkan introduced polar codes and proved that they are capacity achieving over symmetric binary memoryless channels under successive cancellation decoding (SCD). However, the metric used in the SCD algorithm does not incorporate knowledge of future frozen bits. In this paper we take a fresh look at the SCD algorithm and propose two decoding algorithms a) successive cancellation with back-tracking (SC-BT) and successive cancellation with look ahead (SC-LA). Both algorithms try to improve the performance using a memory of size O(N). We also extend the SC-LA algorithm to work with successive cancellation list decoding (SCLD).","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"80 1","pages":"31-35"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83119342","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
On the Optimal Input of the Nondispersive Optical Fiber 非色散光纤的最优输入
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849407
J. Fahs, A. Tchamkerten, Mansoor I. Yousefi
{"title":"On the Optimal Input of the Nondispersive Optical Fiber","authors":"J. Fahs, A. Tchamkerten, Mansoor I. Yousefi","doi":"10.1109/ISIT.2019.8849407","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849407","url":null,"abstract":"The per-sample zero-dispersion channel model of the optical fiber is considered. It is shown that capacity is uniquely achieved by an input probability distribution that has continuous uniform phase and discrete amplitude that takes on finitely many values. This result holds when the channel is subject to general input cost constraints, that include a peak amplitude constraint and a joint average and peak amplitude constraint.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"131-135"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90990852","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
DNN assisted Sphere Decoder DNN辅助球体解码器
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849786
Aymen Askri, G. R. Othman
{"title":"DNN assisted Sphere Decoder","authors":"Aymen Askri, G. R. Othman","doi":"10.1109/ISIT.2019.8849786","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849786","url":null,"abstract":"A modified sphere decoding (SD) scheme is proposed for multiple-input multiple-output (MIMO) communication systems in this paper. The contribution of the paper includes the introduction of a systematic approach to sphere radius design and control based on Deep Neural Networks (DNNs) as well as the complexity advantage yielded by the proposed scheme. The learning model is introduced to predict the number of lattice points inside the sphere with some radius. Since this number is cleverly learnt by a neural network (NNW), the SD updates the radius until expecting a small number of points and then starts the search hypersphere, which greatly reduces the computational complexity. We show through simulation that for high dimensional MIMO systems the number of lattice points highly reduces in the new SD algorithm, which leads to a complexity only 3 times of the MMSE decoder complexity.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"36 1","pages":"1172-1176"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90452788","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}
引用次数: 16
How should we define Information Flow in Neural Circuits? 我们应该如何定义神经回路中的信息流?
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849411
Praveen Venkatesh, Sanghamitra Dutta, P. Grover
{"title":"How should we define Information Flow in Neural Circuits?","authors":"Praveen Venkatesh, Sanghamitra Dutta, P. Grover","doi":"10.1109/ISIT.2019.8849411","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849411","url":null,"abstract":"We develop a theoretical framework for defining information flow in neural circuits, within the context of \"eventrelated\" experimental paradigms in neuroscience. Here, a neural circuit is modeled as a directed graph, with \"clocked\" nodes that send transmissions to each other along the edges of the graph at discrete points in time. We are interested in a definition that captures the flow of \"stimulus\"-related information, and which guarantees a continuous information path between appropriately defined inputs and outputs in the directed graph. Prior measures, including those based on Granger Causality and Directed Information, fail to provide clear assumptions and guarantees about when they correctly reflect stimulus-related information flow, due to the absence of a theoretical foundation with a mathematical definition. We take a methodical approach— iterating through candidate definitions and counterexamples— to arrive at a definition for information flow that is based on conditional mutual information, and which satisfies desirable properties, including the existence of information paths.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"5 1","pages":"176-180"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78571304","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
Code Construction for Pliable Index Coding 柔性索引编码的代码构造
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849812
Shanuja Sasi, B. Rajan
{"title":"Code Construction for Pliable Index Coding","authors":"Shanuja Sasi, B. Rajan","doi":"10.1109/ISIT.2019.8849812","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849812","url":null,"abstract":"A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, \"Pliable index coding\", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a server holding a set of messages and there is a set of clients having a subset of messages with them. Each client is satisfied if it receives any of the message which it doesn’t have. We discuss the class of PICOD where the side information is consecutive. We provide index codes for two cases - for the class where each client gets exactly one desired message and for a class where total number of messages decoded by the effective clients is maximized. Another variant of index coding problem is - c-Constrained Pliable Index Coding Problem [Linqi Song, Christina Fragouli and Tianchu Zhao, \"A Pliable Index Coding Approach to Data Shuffling,\" arXiv:1701.05540v3 [cs.IT] 3 May 2018]. It is basically PICOD with a c-constraint, i.e, each message is decoded by at most c clients demanding that message. We provide index codes for some classes of this variant with consecutive side information.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"527-531"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76270542","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
An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States 有限状态马尔可夫链平均性能优化的迭代算法
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849856
Ryusei Fujita, K. Iwata, Hirosuke Yamamoto
{"title":"An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States","authors":"Ryusei Fujita, K. Iwata, Hirosuke Yamamoto","doi":"10.1109/ISIT.2019.8849856","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849856","url":null,"abstract":"We consider Markov chains with finite states, which have unique stationary distributions and satisfy the following conditions I)–III). I) Each state si has its own discrete parameter ti. II) Each state si has a local performance function f(ti). III) Each state si has a transition probability function pi, j(ti) from state si to state sj. In this paper, we give an iterative method to optimize the global average performance of the above Markov chains, which have unique stationary distributions for all sets of the parameters. This method is a generalization of the iterative method to construct the optimal AIFV-m code, which was proposed in our previous paper. But in this paper, the following two points are further refined besides the generalization. (i) We clarify the condition such that the iterative method always terminates and gives correct results although the iterative method is a kind of Las Vegas algorithm. (ii) We provide a closed-form expression of coefficients to solve the local optimization problem of each state.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"28 1","pages":"1902-1906"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74738540","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}
引用次数: 10
A Variational Signal-Space Distance Measure for Nondispersive Optical Fiber 非色散光纤的变分信号空间距离测量
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849772
Reza Rafie Borujeny, F. Kschischang
{"title":"A Variational Signal-Space Distance Measure for Nondispersive Optical Fiber","authors":"Reza Rafie Borujeny, F. Kschischang","doi":"10.1109/ISIT.2019.8849772","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849772","url":null,"abstract":"The nondispersive per-sample channel model for the optical fiber channel is considered. Under some smoothness assumptions, the problem of finding the minimum amount of noise energy that can render two different input points indistinguishable is formulated. The necessary conditions for the noise trajectory that has the minimum energy are described as a system of nonlinear differential equations. It is suggested that this model can be generalized to consider dispersion and to design new communication schemes for fiber-optic communication systems.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"22 1","pages":"141-145"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74787521","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
Linear Permutation Polynomial Codes 线性置换多项式码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849422
Ryoichiro Yoshida, K. Kasai
{"title":"Linear Permutation Polynomial Codes","authors":"Ryoichiro Yoshida, K. Kasai","doi":"10.1109/ISIT.2019.8849422","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849422","url":null,"abstract":"Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They have two drawbacks: lack of randomness and limited girth lead to a degraded decoding performance in the waterfall and error floor regions, respectively. To tackle these problems, we present a new class of LDPC codes, named linear permutation polynomial (LPP) codes, whose parity-check matrix consists of permutation matrices based on LPPs. The girth of regular QC-LDPC codes is upper bounded by 12, while LPP codes break this limit. We demonstrate that LPP codes have error performance almost equivalent to random ones.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"66-70"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81755830","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
Stein’s Lemma for Classical-Quantum Channels 经典量子通道的斯坦引理
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849562
M. Berta, C. Hirche, Eneet Kaur, M. Wilde
{"title":"Stein’s Lemma for Classical-Quantum Channels","authors":"M. Berta, C. Hirche, Eneet Kaur, M. Wilde","doi":"10.1109/ISIT.2019.8849562","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849562","url":null,"abstract":"It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8), 3807 (2009)] showed that in the asymptotic regime, the exponential error rate for the discrimination of classical channels is not improved in the adaptive setting. We show that, for the discrimination of classical-quantum channels, adaptive strategies do not lead to an asymptotic advantage. As our main result, this establishes Stein’s lemma for classical-quantum channels. Our proofs are based on the concept of amortized distinguishability of channels, which we analyse using entropy inequalities.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"133 1","pages":"2564-2568"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77770248","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}
引用次数: 5
Non-Malleable Codes against Active Physical Layer Adversary 针对主动物理层对手的非延展性代码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849438
Fuchun Lin, R. Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang
{"title":"Non-Malleable Codes against Active Physical Layer Adversary","authors":"Fuchun Lin, R. Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang","doi":"10.1109/ISIT.2019.8849438","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849438","url":null,"abstract":"Non-malleable codes are randomized codes that protect coded messages against modification by functions in a tampering function class. These codes are motivated by providing tamper resilience in applications where a cryptographic secret is stored in a tamperable storage device and the protection goal is to ensure that the adversary cannot benefit from their physical tampering with the device. In this paper we consider nonmalleable codes for protection of secure communication against active physical layer adversaries. We define a class of functions that closely model tampering of communication by adversaries who can eavesdrop on a constant fraction of the transmitted codeword, and use this information to select a vector of tampering functions that will be applied to a second constant fraction of codeword components (possibly overlapping with the first set). We derive rate bounds for non-malleable codes for this function class and give a modular construction that adapts and provides new analysis for an existing construction in the new setting. We discuss our results and directions for future work.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"571 1","pages":"2753-2757"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77783873","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学术官方微信