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

2014 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks 检查-混合GLDPC代码:通过超级检查系统地消除陷阱集
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874923
V. Ravanmehr, D. Declercq, B. Vasic
{"title":"Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks","authors":"V. Ravanmehr, D. Declercq, B. Vasic","doi":"10.1109/ISIT.2014.6874923","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874923","url":null,"abstract":"In this paper, we propose a new approach to constructing a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. This approach is based on converting selected checks of an LDPC code involving a trapping set to super checks corresponding to a shorter error correcting component code. In particular, we follow two goals in constructing the check-hybrid GLDPC codes: First, the super checks are replaced based on the knowledge of trapping sets of the global LDPC code. We show that by converting only some single checks to super checks the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the number of super checks required for eliminating certain trapping sets is minimized to reduce the rate-loss. We first give an algorithm to find a set of critical checks in a trapping set of an LDPC code and then we provide some upper bounds on the minimum number of critical checks needed to eliminate certain trapping sets in the parity-check matrix of an LDPC code. A possible fixed set for a class of check-hybrid codes is also given.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123186523","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
Second order refinements for the classical capacity of quantum channels with separable input states 具有可分离输入态的量子通道经典容量的二阶改进
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874811
M. Tomamichel, V. Tan
{"title":"Second order refinements for the classical capacity of quantum channels with separable input states","authors":"M. Tomamichel, V. Tan","doi":"10.1109/ISIT.2014.6874811","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874811","url":null,"abstract":"We study the non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of information that can be transmitted when the channel is used a finite number of times and a finite average decoding error is permissible. We show that, if we restrict the encoder to use ensembles of separable states, the non-asymptotic fundamental limit admits a Gaussian approximation that illustrates the speed at which the rate of optimal codes converges to the Holevo capacity as the number of channel uses tends to infinity. To do so, several important properties of quantum information quantities, such as the capacity-achieving output state, the divergence radius, and the channel dispersion, are generalized from their classical counterparts. Further, we exploit a close relation between classical-quantum channel coding and quantum binary hypothesis testing and rely on recent progress in the non-asymptotic characterization of quantum hypothesis testing and its Gaussian approximation.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123227694","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
The efficiency of optimal sampling in the random S-box model 随机s盒模型中最优抽样的效率
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875126
Paul Stankovski, Lennart Brynielsson, Martin Hell
{"title":"The efficiency of optimal sampling in the random S-box model","authors":"Paul Stankovski, Lennart Brynielsson, Martin Hell","doi":"10.1109/ISIT.2014.6875126","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875126","url":null,"abstract":"In this paper we show a closed caption formula for the efficiency of the optimal sampling technique in the random S-box model. This formula is derived by analyzing the given model and sampling technique using statistical techniques. We further generalize the original random S-box model in two ways; allowing multiple-bit entries, xor of several random S-box outputs. For all cases we show the corresponding closed caption efficiency formula. Using these new formulas, it is now possible to instantaneously give accurate analytical estimates of the output quality of random S-boxes. This can be of great practical importance in, for example, analysis and design of cryptographic primitives based on such building blocks.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377182","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
Lossy compression of permutations 排列的有损压缩
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874785
Da Wang, A. Mazumdar, G. Wornell
{"title":"Lossy compression of permutations","authors":"Da Wang, A. Mazumdar, G. Wornell","doi":"10.1109/ISIT.2014.6874785","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874785","url":null,"abstract":"We investigate the lossy compression of permutations by analyzing the trade-off between the size of a source code and the distortion with respect to Kendall tau distance, Spearman's footrule, Chebyshev distance and ℓ1 distance of inversion vectors. We show that given two permutations, Kendall tau distance upper bounds the ℓ1 distance of inversion vectors and a scaled version of Kendall tau distance lower bounds the ℓ1 distance of inversion vectors with high probability, which indicates an equivalence of the source code designs under these two distortion measures. Similar equivalence is established for all the above distortion measures, every one of which has different operational significance and applications in ranking and sorting. These findings show that an optimal coding scheme for one distortion measure is effectively optimal for other distortion measures above.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116262398","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
Secrecy gain, flatness factor, and secrecy-goodness of even unimodular lattices 偶非模格的保密增益、平坦度因子和保密良度
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874977
Fuchun Lin, Cong Ling, J. Belfiore
{"title":"Secrecy gain, flatness factor, and secrecy-goodness of even unimodular lattices","authors":"Fuchun Lin, Cong Ling, J. Belfiore","doi":"10.1109/ISIT.2014.6874977","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874977","url":null,"abstract":"Nested lattices Ae ⊂ Ab have previously been studied for coding in the Gaussian wiretap channel and two design criteria, namely, the secrecy gain and flatness factor, have been proposed to study how the coarse lattice Ae should be chosen so as to maximally conceal the message against the eavesdropper. In this paper, we study the connection between these two criteria and show the secrecy-goodness of even unimodular lattices, which means exponentially vanishing flatness factor as the dimension grows.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127672414","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
Compression and predictive distributions for large alphabet i.i.d and Markov models 大字母id和马尔可夫模型的压缩和预测分布
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875285
Xiao Yang, A. Barron
{"title":"Compression and predictive distributions for large alphabet i.i.d and Markov models","authors":"Xiao Yang, A. Barron","doi":"10.1109/ISIT.2014.6875285","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875285","url":null,"abstract":"This paper considers coding and predicting sequences of random variables generated from a large alphabet. We start from the i.i.d model and propose a simple coding distribution formulated by a product of tilted Poisson distributions which achieves close to optimal performance. Then we extend to Markov models, and in particular, tree sources. A context tree based algorithm is designed according to the frequency of various contexts in the data. It is a greedy algorithm which seeks for the greatest savings in codelength when constructing the tree. Compression and prediction of individual counts associated with the contexts again uses a product of tilted Poisson distributions. Implementing this method on a Chinese novel, about 20.56% savings in codelength is achieved compared to the i.i.d model.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128046935","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
Improved performance of LDPC-coded MIMO systems with EP-based soft-decisions 基于ep的软决策改进ldpc编码MIMO系统的性能
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875183
Javier Céspedes, P. Olmos, M. S. Fernández, F. Pérez-Cruz
{"title":"Improved performance of LDPC-coded MIMO systems with EP-based soft-decisions","authors":"Javier Céspedes, P. Olmos, M. S. Fernández, F. Pérez-Cruz","doi":"10.1109/ISIT.2014.6875183","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875183","url":null,"abstract":"Modern communications systems use efficient encoding schemes, multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the dimensions of the system grow, the design of efficient and low-complexity MIMO receivers possesses technical challenges. Symbol detection can no longer rely on conventional approaches for posterior probability computation due to complexity. Marginalization of this posterior to obtain per-antenna soft-bit probabilities to be fed to a channel decoder is computationally challenging when realistic signaling is used. In this work, we propose to use Expectation Propagation (EP) algorithm to provide an accurate low-complexity Gaussian approximation to the posterior, easily solving the posterior marginalization problem. EP soft-bit probabilities are used in an LDPC-coded MIMO system, achieving outstanding performance improvement compared to similar approaches in the literature for low-complexity LDPC MIMO decoding.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129991689","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}
引用次数: 12
Efficient approximation of discrete memoryless channel capacities 离散无存储器信道容量的有效近似
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875365
David Sutter, Peyman Mohajerin Esfahani, Tobias Sutter, J. Lygeros
{"title":"Efficient approximation of discrete memoryless channel capacities","authors":"David Sutter, Peyman Mohajerin Esfahani, Tobias Sutter, J. Lygeros","doi":"10.1109/ISIT.2014.6875365","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875365","url":null,"abstract":"We propose an iterative method for efficiently approximating the capacity of discrete memoryless channels, possibly having additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To find an ε-approximation of the capacity, in case of no additional input constraints, the presented method has a computational complexity O(1 over εM2N√(logN)), where N and M denote the input and output alphabet size, and a single iteration has a complexity O(MN).","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679282","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
Efficient compression of monotone and m-modal distributions 单调分布和m-模态分布的有效压缩
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875157
Jayadev Acharya, Ashkan Jafarpour, A. Orlitsky, A. Suresh
{"title":"Efficient compression of monotone and m-modal distributions","authors":"Jayadev Acharya, Ashkan Jafarpour, A. Orlitsky, A. Suresh","doi":"10.1109/ISIT.2014.6875157","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875157","url":null,"abstract":"We consider universal compression of n samples drawn independently according to a monotone or m-modal distribution over k elements. We show that for all these distributions, the per-sample redundancy diminishes to 0 if k = exp(o(n/log n)) and is at least a constant if k = exp(Ω(n)).","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127837871","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
Polyhedral description of the symmetrical latency capacity region of broadcast channels 广播信道对称延迟容量区域的多面体描述
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875208
Amir Salimi, Tie Liu, Shuguang Cui
{"title":"Polyhedral description of the symmetrical latency capacity region of broadcast channels","authors":"Amir Salimi, Tie Liu, Shuguang Cui","doi":"10.1109/ISIT.2014.6875208","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875208","url":null,"abstract":"This paper provides a polyhedral description of the symmetrical latency capacity region of broadcast channels. The converse result is established via the recently proposed generalized cut-set bounds for broadcast networks. The achievability result is proved by considering a “pairwise exchange” scheme and successive encoding.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131671590","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学术官方微信