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

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

筛选
英文 中文
Modeling Packet Losses in Communication Networks 通信网络中的丢包建模
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849400
I. Bocharova, B. Kudryashov, M. Rabi, Nikita Lyamin, Wouter Dankers, Erik Frick, A. Vinel
{"title":"Modeling Packet Losses in Communication Networks","authors":"I. Bocharova, B. Kudryashov, M. Rabi, Nikita Lyamin, Wouter Dankers, Erik Frick, A. Vinel","doi":"10.1109/ISIT.2019.8849400","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849400","url":null,"abstract":"An approach to constructing discrete models of packet losses suitable for a wide variety of communication network applications is studied. It is based on estimating parameters of probabilistic automata described via so-called pseudo-Markov chains. The new technique is applied both to approximating a discrete time analog process at the output of known channel models and to the experimental data stream. Comparison of models is performed by computing probabilities of more than m losses out of n transmitted packets (P (≥ m, n)). It is shown that for the Rician fading channel with exponential correlation and correlation determined by a Bessel filter, the obtained rank-two and rank-three discrete modes, respectively, provide high accuracy coincidence of P (≥ m, n) performances. The rank-three discrete model computed on the experimental data stream obtained from the LTE network provides significantly better approximation of P (≥ m, n) performance than that obtained by the Baum-Welch algorithm.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"19 1","pages":"1012-1016"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88775297","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
Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users 编码缓存的子空间编码:满足三个用户的分散和集中放置
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849613
Hadi Reisizadeh, M. Maddah-ali, S. Mohajer
{"title":"Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users","authors":"Hadi Reisizadeh, M. Maddah-ali, S. Mohajer","doi":"10.1109/ISIT.2019.8849613","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849613","url":null,"abstract":"Coded caching is a new approach to decrease the communication load during the peak hours of the network. It provides a significant gain, that is maximized in the centralized setting, where the server controls the placement. In many situations, each user fills its cache without any information about the placement of other users. We show that subspace precoding for placement improves the delivery load of a decentralized caching system compared to uncoded placement. Surprisingly, the proposed scheme achieves the delivery load of the centralized placement for K = 3 users for the entire range of cache size.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"55 1","pages":"677-681"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75989644","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
Complexity and Similarity for Sequences using LZ77-based conditional information measure 基于lz77的条件信息度量序列的复杂度和相似性
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849610
François Cayre, N. L. Bihan
{"title":"Complexity and Similarity for Sequences using LZ77-based conditional information measure","authors":"François Cayre, N. L. Bihan","doi":"10.1109/ISIT.2019.8849610","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849610","url":null,"abstract":"This work concerns the definition of conditional mutual information in the framework of Algorithmic Information Theory (AIT), which is of use when no probabilistic model of the data is available, or hard to devise. We introduce a practical way to construct a conditional mutual information quantity which respects the chain rule and the data processing inequalityThe proposed implementation, named SALZA, allows to accomplish various information-theoretic tasks on sequences. The algorithmic model of the data used in this work is that of the well-known Lempel-Ziv primitive: we assume new data is to be expressed in terms of references to prior data.SALZA enables a flexible specification of prior data and extracts information quantities based on the significance of the references to these prior data. The tool readily implements the computation of an information measure based on LZ77 and a universal classifier based on the Ziv-Merhav relative coder for the universal clustering of sequences.Illustration of the proposed implementation is provided on clustering and causality inference examples.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"64 1","pages":"2454-2458"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74818092","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
The CEO Problem with rth Power of Difference Distortion 差分失真的CEO问题
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849701
Daewon Seo, L. Varshney
{"title":"The CEO Problem with rth Power of Difference Distortion","authors":"Daewon Seo, L. Varshney","doi":"10.1109/ISIT.2019.8849701","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849701","url":null,"abstract":"The CEO problem has received a lot of attention since Berger et al. first investigated it, however, there are limited results on non-Gaussian models with non-quadratic distortion measures. In this work, we extend the CEO problem to two continuous-alphabet settings with general rth power of difference distortion, and study asymptotics of distortion as the number of agents and sum rate grow without bound. The first setting is a regular source-observation model, such as jointly Gaussian, with difference distortion and we show that the distortion decays at $R_{{text{sum}}}^{ - r/2}$ up to a multiplicative constant. The other setting is a non-regular source-observation model, such as copula or uniform additive noise models, for which estimation-theoretic regularity conditions do not hold. The optimal decay R−rsum is obtained for the non-regular model.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"55 1","pages":"2034-2038"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85729458","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
Improved Iterative Decoding of Product Codes Based on Trusted Symbols 基于可信符号的改进产品代码迭代解码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849469
C. Senger
{"title":"Improved Iterative Decoding of Product Codes Based on Trusted Symbols","authors":"C. Senger","doi":"10.1109/ISIT.2019.8849469","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849469","url":null,"abstract":"Iterative decoding of product codes constructed from constituent generalized Reed–Solomon codes (or subcodes thereof, such as Bose–Chaudhuri–Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"97 1","pages":"1342-1346"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86611991","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
Variable-length Coding Error Exponents for the AWGN Channel with Noisy Feedback at Zero-Rate 零速率噪声反馈AWGN信道的变长编码误差指数
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849578
K. Palacio-Baus, N. Devroye
{"title":"Variable-length Coding Error Exponents for the AWGN Channel with Noisy Feedback at Zero-Rate","authors":"K. Palacio-Baus, N. Devroye","doi":"10.1109/ISIT.2019.8849578","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849578","url":null,"abstract":"A one-way additive white Gaussian noise (AWGN) channel with active feedback sent over another AWGN feedback channel is considered. Achievable error exponents are presented in the finite message / zero-rate regime for a variable length coding (VLC) scheme. This coding scheme uses a form of round-robin scheduling of messages, and a simplex-based feedback code to obtain reliable feedback and remain synchronized, despite the noise in the feedback link. Our results show that this new VLC scheme under an almost-sure power constraint achieves an error exponent similar to an achievable exponent attained using a fixed block length scheme under a much more relaxed expected block power constraint, and is larger than that achieved by schemes without feedback.1","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"22 1","pages":"2254-2258"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86410966","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
Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles 一类带外环的交联环结构的最优索引码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849349
Shanuja Sasi, B. Rajan
{"title":"Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles","authors":"Shanuja Sasi, B. Rajan","doi":"10.1109/ISIT.2019.8849349","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849349","url":null,"abstract":"For index coding problems with special structure on the side-information graphs called Interlinked Cycle (IC) structures index codes have been proposed in the literature (C. Thapa, L. Ong, and S. Johnson, \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in IEEE Trans. Inf. Theory, vol. 63, no. 6, Jun. 2017 with a correction in \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in arxiv (arxiv:1603.00092v2 [cs.IT] 25 Feb 2018)). In this paper we consider a generalization of IC structures called IC structures with interlocked outer cycles. For IC structures with interlocked outer cycles we show that the optimal length (also known as the minrank of the index coding problem) depends on the maximum number of disjoint outer cycles. We give two sufficient conditions such that if any of these is satisfied then we provide explicit optimal index code construction. The conditions mentioned above are shown to be not necessary by an explicit example.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1982 1","pages":"2314-2318"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82207548","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
Manufacturing an Erasure Wiretap Channel from Channel Sounding Measurements 从通道测深测量制造Erasure窃听通道
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849638
Dakota Flanary, Benjamin Jensen, Bradford Clark, Kalin Norman, Nathan Nelson, M. Rice, Willie K. Harrison
{"title":"Manufacturing an Erasure Wiretap Channel from Channel Sounding Measurements","authors":"Dakota Flanary, Benjamin Jensen, Bradford Clark, Kalin Norman, Nathan Nelson, M. Rice, Willie K. Harrison","doi":"10.1109/ISIT.2019.8849638","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849638","url":null,"abstract":"In this paper we provide a real-world test of physical-layer security using channel sounding techniques in an indoor wireless network. We consider the possibility of exploiting issues that arise in practical receivers to manufacture a discrete memoryless wiretap channel model from the Gaussian case, and show how the secrecy capacity of the Gaussian wiretap channel model changes as these issues are considered. Results indicate that the secrecy capacity is a function of the manufactured channel model, physical antenna location, and power settings at the transmitter. These parameters can be optimized to maximize the potential for secrecy in the network.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"4 1","pages":"320-324"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82388225","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
AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes 基于avn的QC LDPC码鞣制图短周期消除
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849632
I. Bocharova, B. Kudryashov, Vitaly Skachek
{"title":"AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes","authors":"I. Bocharova, B. Kudryashov, Vitaly Skachek","doi":"10.1109/ISIT.2019.8849632","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849632","url":null,"abstract":"One of the most efficient approaches to improving the frame error rate (FER) performance of low-density parity-check (LDPC) codes is based on adding both auxiliary variable nodes (AVN) and the corresponding redundant parity checks (RPC) to the binary parity-check matrices of the code. It is known that for the LDPC codes, whose Tanner graphs contain length four cycles, this technique allows for substantial improvement in the FER performance of the belief-propagation (BP) decoding on the binary erasure channel (BEC) channel. The AVN-based technique followed by adding orthogonal redundant parity-checks is known to be efficient for both the BEC and additive white Gaussian noise (AWGN) channels. In this paper, firstly, the AVN-based approach is generalized to efficiently removing cycles of length larger than four. Secondly, the AVN-based technique is reformulated in terms of labeled base matrices of quasi-cyclic (QC) LDPC codes. An improved iterative decoding of QC LDPC codes is proposed, which is applied to the labeled base matrices of QC LDPC codes extended by the AVN-RPC technique.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"38 1","pages":"56-60"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79279507","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
A Method to Improve Consensus Averaging using Quantized ADMM 一种改进量化ADMM一致性平均的方法
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849561
Nandan Sriranga, C. Murthy, V. Aggarwal
{"title":"A Method to Improve Consensus Averaging using Quantized ADMM","authors":"Nandan Sriranga, C. Murthy, V. Aggarwal","doi":"10.1109/ISIT.2019.8849561","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849561","url":null,"abstract":"In this paper, a method is proposed to overcome the consensus error in an average consensus problem, under a distributed setting and with finite-bit communications between the network agents. Previous works have illustrated that the average consensus problem can be solved under a distributed setting, using the Alternating Direction Method of Multipliers (ADMM) method, in which consensus can be attained by using locally available information along with information from neighboring nodes. This holds true even under finite-bit exchanges between neighbouring nodes, but suffers from consensus errors and cyclic states due to the introduced quantization schemes. This work deals with achieving perfect consensus with finite-bit communications between neighboring nodes. We propose an algorithm which leads to perfect consensus in an asymptotic sense, without the need to increase the per-exchange communication rate of the network.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"51 1","pages":"507-511"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81259977","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
首页 上一页 下一页 尾页
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学术官方微信