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

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

筛选
英文 中文
Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures 校正多相位擦除突发的准循环LDPC码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849853
Xin Xiao, B. Vasic, Shu Lin, K. Abdel-Ghaffar, W. Ryan
{"title":"Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures","authors":"Xin Xiao, B. Vasic, Shu Lin, K. Abdel-Ghaffar, W. Ryan","doi":"10.1109/ISIT.2019.8849853","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849853","url":null,"abstract":"This paper presents designs and constructions of two classes of binary quasi-cyclic LDPC codes for correcting multiple random phased-bursts of erasures over the binary erasure channel. The erasure correction of codes in both classes is characterized by the cycle and adjacency structure of their Tanner graphs. Erasure correction of these codes is a very simple process which requires only modulo-2 additions. The codes in the second class are capable of correcting locally and globally distributed phased-bursts of erasures with a two-phase iterative erasure-correction process.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"52 1","pages":"71-75"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74262149","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
Quantum Coding via Semidefinite Programming 基于半定规划的量子编码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849325
M. Berta, Francesco Borderi, Omar Fawzi, V. Scholz
{"title":"Quantum Coding via Semidefinite Programming","authors":"M. Berta, Francesco Borderi, Omar Fawzi, V. Scholz","doi":"10.1109/ISIT.2019.8849325","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849325","url":null,"abstract":"We derive converging hierarchies of efficiently computable semidefinite programming outer bounds on the optimal fidelity for the transmission of quantum information over noisy quantum channels. Based on positive partial transpose conditions we give a sufficient criterion for the exact convergence at any given level of the hierarchies. The worst case convergence speed of our hierarchies is quantified via positive semidefinite representable outer approximations on the set of separable Choi states, which are based on novel finite de Finetti theorems for quantum channels.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"260-264"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77288044","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
On the size of pairwise-colliding permutations 关于成对碰撞排列的大小
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849602
J. Körner, Chandra Nair, David Ng
{"title":"On the size of pairwise-colliding permutations","authors":"J. Körner, Chandra Nair, David Ng","doi":"10.1109/ISIT.2019.8849602","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849602","url":null,"abstract":"A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"18 1","pages":"2354-2358"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78459394","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
Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor 将非平凡自同构群码的译码速度提高到一个指数因子
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849628
Rodolfo Canto Torres, J. Tillich
{"title":"Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor","authors":"Rodolfo Canto Torres, J. Tillich","doi":"10.1109/ISIT.2019.8849628","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849628","url":null,"abstract":"We give an algorithm that is able to speed up the decoding of a code with a non-trivial automorphism group, by summing for the word that has to be decoded, all its entries belonging to a same orbit and decoding the resulting word in a reduced code. For a certain range of parameters, this results in a decoding that is faster by an exponential factor in the codelength when compared to the best algorithms for decoding generic linear codes. This algorithm is then used to break several proposals of public-key cryptosystems based on codes with a non-trivial automorphism group.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"80 1","pages":"1927-1931"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83958654","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
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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信