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

2007 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes 基于QC-LDPC码的McEliece密码系统新实例的密码分析
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557609
M. Baldi, F. Chiaraluce
{"title":"Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes","authors":"M. Baldi, F. Chiaraluce","doi":"10.1109/ISIT.2007.4557609","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557609","url":null,"abstract":"We adopt a class of quasi-cyclic low-density parity-check codes that allow to overcome the main limitations of the original McEliece cryptosystem based on Goppa codes, that are large key size and low transmission rate. The codes are designed by using a new algorithm based on \"random difference families\" that permits to construct very large sets of equivalent codes. An extensive cryptanalysis is developed to verify the security level achievable through a selected choice of the system parameters. While previous versions of the McEliece cryptosystem based on LDPC codes are vulnerable to the considered attacks, a new scheme is proposed that ensures satisfactory system robustness with reduced key size and increased transmission rate. Moreover, it is established that the new cryptosystem can be fast enough to justify its adoption as an alternative to widespread solutions, like RSA.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"52 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122565925","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}
引用次数: 120
Accelerating Distributed Consensus Via Lifting Markov Chains 通过提升马尔可夫链加速分布式共识
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557655
Wen J. Li, H. Dai
{"title":"Accelerating Distributed Consensus Via Lifting Markov Chains","authors":"Wen J. Li, H. Dai","doi":"10.1109/ISIT.2007.4557655","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557655","url":null,"abstract":"Existing works on distributed averaging explore linear iterations based on reversible Markov chains. The convergence of such algorithms is bounded to be slow due to the diffusive behavior of the reversible chains. It has been observed that certain nonreversible chains lifted from reversible ones mix substantially faster than the original chains. We show that the idea of nonreversible lifting lends itself naturally to a fast distributed averaging algorithm, where each node maintains multiple estimates, corresponding to multiple lifted states in the Markov chain. We give a rigorous proof that it is possible to achieve an e-averaging time of Theta(k log(1/isin)) on a k times k grid. For a general wireless network, we propose a Location-Aided Distributed Averaging (LADA) algorithm, which utilizes local information to construct a fast-mixing nonreversible chain in a distributed manner. We show that using LADA, an e-averaging time of Theta(r-1 log(1/isin)) is achievable in a wireless network with transmission radius r.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122700553","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
Occupancy Distribution of Queueing Systems with Opportunistic Scheduling in the Downlink 具有下行机会调度的排队系统的占用分布
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557670
M. Dashouk, M. Alanyali, M. Sharif
{"title":"Occupancy Distribution of Queueing Systems with Opportunistic Scheduling in the Downlink","authors":"M. Dashouk, M. Alanyali, M. Sharif","doi":"10.1109/ISIT.2007.4557670","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557670","url":null,"abstract":"We consider a block-fading homogeneous broadcast channel with n users each receiving packets randomly and independently with a rate of lambda. Packets are stored in separate queues to await transmission using an opportunistic scheduling which exploits the multiuser diversity of the channel by serving the user with the most favorable channel condition at each coherence interval. In this paper, we consider a stochastic model in which mean packet transmission time is n-1 and establish a convergence result for the occupancy distribution of all n queues under opportunistic scheduling. It is shown that if lambda < 1 then the expected length of the longest queue is less than log1/lambda n + O(1) for large n. In order to improve the occupancy distribution while exploiting the multiuser diversity, we also study a scheme that serves the user with the longest queue among the d users with the most favorable channel conditions. It is shown that upper bound on the expected length of the longest queue improves to logd/lambda n + O(1). Simulation results are presented to validate our asymptotic results.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"477 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122740813","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 binary primitive BCH codes with minimum distance 8 and exponential sums 最小距离为8的二进制原始BCH码和指数和
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557155
P. Charpin, T. Helleseth, V. Zinoviev
{"title":"On binary primitive BCH codes with minimum distance 8 and exponential sums","authors":"P. Charpin, T. Helleseth, V. Zinoviev","doi":"10.1109/ISIT.2007.4557155","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557155","url":null,"abstract":"The exact expressions for the number of codewords of weight 4 in the cosets of weight 4 of binary primitive BCH codes of length n = 2m (m even) with minimum distance 8 is given in terms of several exponential sums, including cubic sums and Kloosterman sums. This provides a bound on the number of codewords of weight 4 in the cosets of weight 4 and also some limitations for possible values of Kloosterman sums over GF(2m), (m even).","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122923337","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
Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals 中立观察者的全知通信与多终端的信息论密钥协议
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557523
A. Gohari, V. Anantharam
{"title":"Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals","authors":"A. Gohari, V. Anantharam","doi":"10.1109/ISIT.2007.4557523","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557523","url":null,"abstract":"We derive a new upper bound on the secrecy capacity in the source model with eavesdropper which strictly improves the currently best upper bound, i.e. the double intrinsic information bound of Renner and Wolf. Furthermore, unlike that bound, which is defined only in the case of two terminals, the new upper bound is not specific to the two terminals case. We define a problem of communication for omniscience by a neutral observer and establish the equivalence between this new problem and the problem of secret key agreement.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300672","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}
引用次数: 13
Pattern Recognition System Design with Linear Encoding for Discrete Patterns 离散模式线性编码模式识别系统设计
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557243
Po-Hsiang Lai, J. O’Sullivan
{"title":"Pattern Recognition System Design with Linear Encoding for Discrete Patterns","authors":"Po-Hsiang Lai, J. O’Sullivan","doi":"10.1109/ISIT.2007.4557243","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557243","url":null,"abstract":"Pattern recognition systems based on compressed patterns and compressed sensor measurements can be designed using low-density matrices. We examine truncation encoding where a subset of the patterns and measurements are stored perfrectly while the rest is discarded. We also examine the use of LDPC parity check matrices for compressing measurements and patterns. We show how more general ensembles of good linear codes can be used as the basis for pattern recognition system design, yielding system design strategies for more general noise models.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606243","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
Exponential Curvature of Markov Models 马尔可夫模型的指数曲率
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557657
J. Takeuchi, T. Kawabata
{"title":"Exponential Curvature of Markov Models","authors":"J. Takeuchi, T. Kawabata","doi":"10.1109/ISIT.2007.4557657","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557657","url":null,"abstract":"We prove that the non FSMX tree model is not an exponential family. It is noted in [Weinberger et al., 95] that the tree source is classified into two classes; a FSMX source or not, depending on shape of the context tree. The FSMX source is a tree source and a finite state machine. It is known that the FSMX model is an exponential family. In this situation our concern is whether the non FSMX tree model is an exponential family or not. This paper's contribution is to show that the non FSMX tree model is not an exponential family. Hence, for the tree model, to be an FSMX model is a necessary and sufficient condition for to be an exponential family.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122175125","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}
引用次数: 9
Study on the genetic code: comparison with multiplexed codes 遗传密码的研究:与复用密码的比较
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557621
G. Sicot, R. Pyndiah
{"title":"Study on the genetic code: comparison with multiplexed codes","authors":"G. Sicot, R. Pyndiah","doi":"10.1109/ISIT.2007.4557621","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557621","url":null,"abstract":"The genetic code is a key concept in genetics. This code establishes the link between the DNA (desoxyribonucleic acid), composed of nucleic acids, and proteins, composed of amino acids. The genetic code is known to be universal, indeed almost all organisms use this code, and it is degenerated, this means that several sequences of nucleic acids can be translated into the same amino acid. This feature is also present in multiplexed codes which is a new concept recently introduced for robust source coding. In this paper we present a comparison between multiplexed codes and the genetic code. We show why this comparison is relevant, and we point out the fact that the genetic code is almost optimal in the context of multiplexed codes theory.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129545590","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
Towards Reliable Broadcasting using ACKs 使用ack实现可靠广播
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557379
M. Durvy, C. Fragouli, Patrick Thiran
{"title":"Towards Reliable Broadcasting using ACKs","authors":"M. Durvy, C. Fragouli, Patrick Thiran","doi":"10.1109/ISIT.2007.4557379","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557379","url":null,"abstract":"We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129947141","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}
引用次数: 40
Secret Communication with a Fading Eavesdropper Channel 基于衰落窃听信道的秘密通信
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557402
Zang Li, R. Yates, W. Trappe
{"title":"Secret Communication with a Fading Eavesdropper Channel","authors":"Zang Li, R. Yates, W. Trappe","doi":"10.1109/ISIT.2007.4557402","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557402","url":null,"abstract":"We investigate the achievable secrecy rate with Gaussian random codes when the main channel is an AWGN channel, while the eavesdropper's channel is Rayleigh fading with additive Gaussian noise. Several transmission strategies according to the main channel's relative channel gain are proposed and evaluated. We show that even if the main channel channel gain is arbitrarily worse than the eavesdropper's average channel gain, positive secrecy rate can still be achieved with artificial noise injection and a burst signaling strategy.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404278","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}
引用次数: 84
首页 上一页 下一页 尾页
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学术官方微信