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

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)最新文献

筛选
英文 中文
Space-time code design with CPM transmission CPM传输的空时码设计
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936190
Xiaoxiao Zhang, M. Fitz
{"title":"Space-time code design with CPM transmission","authors":"Xiaoxiao Zhang, M. Fitz","doi":"10.1109/ISIT.2001.936190","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936190","url":null,"abstract":"Design criterion for space-time codes with continuous phase modulation (CPM) in a quasistatic fading channel is given. Space-time codes are proposed and simulation results demonstrate their good performance.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128162355","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}
引用次数: 20
Decoding of low-density parity check codes over finite-state binary Markov channels 有限状态二进制马尔可夫信道上低密度奇偶校验码的解码
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935935
J. Garcia-Frías
{"title":"Decoding of low-density parity check codes over finite-state binary Markov channels","authors":"J. Garcia-Frías","doi":"10.1109/ISIT.2001.935935","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935935","url":null,"abstract":"We propose a modified algorithm for decoding of low-density parity check codes over finite-state binary Markov channels. The hidden Markov model representing the channel is incorporated into the bipartite graph of the low-density parity check code, and the message passing algorithm is modified accordingly. This approach clearly outperforms systems in which the channel statistics are not exploited in the decoding, allowing reliable communication at rates which are above the capacity of a memoryless channel with the same stationary bit error probability as the Markov channel. Moreover, we introduce a joint estimation/decoding method that allows the estimation of the parameters of the channel when they are not known a priori.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817170","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
Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains 由几乎完全可分解马尔可夫链调制的泊松过程的简化复杂性估计
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936070
Vikram Krishnamurthy, Subhrakanti Dey
{"title":"Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains","authors":"Vikram Krishnamurthy, Subhrakanti Dey","doi":"10.1109/ISIT.2001.936070","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936070","url":null,"abstract":"We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833798","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
A new, fast block cipher design: COS ciphers 一种新的快速分组密码设计:COS密码
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936001
E. Filiol, Djessy Vianne, C. Fontaine
{"title":"A new, fast block cipher design: COS ciphers","authors":"E. Filiol, Djessy Vianne, C. Fontaine","doi":"10.1109/ISIT.2001.936001","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936001","url":null,"abstract":"When designing secret key ciphers, one approach which has not been very often considered so far, is the construction of block ciphers out of stream ciphers. It nevertheless would combine the advantage of both sides without their respective drawbacks. Only few attempts have been presented yet, and we propose here a completely new approach to block cipher design. By using strong Boolean functions and non-linear feedback shift register (NLFSR), we build a family of block ciphers called crossing over system (COS) ciphers, with arbitrary block size, and a key size of 128, 256 or 192 bits. It is based on a new design called crossing-over, using the internal state of NLFSRs as the constituent of the ciphering output blocks. Two versions have been developed: one considers any kind of plaintext, and the other one is devoted to plaintext without redundancy (e.g. compressed).","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115965905","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
Poisson's law and information theory 泊松定律和信息论
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935909
P. Harremoes, Aureh
{"title":"Poisson's law and information theory","authors":"P. Harremoes, Aureh","doi":"10.1109/ISIT.2001.935909","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935909","url":null,"abstract":"The binomial and the Poisson distributions are shown to be maximum entropy distributions of suitably defined sets. Poisson's law is considered as a case of entropy maximization, and also convergence in information divergence is established.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132245374","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
Improving Gallager's upper bound on Huffman codes redundancy 改进Huffman码冗余的Gallager上界
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936081
Jia-Pei Shen, J. Gill
{"title":"Improving Gallager's upper bound on Huffman codes redundancy","authors":"Jia-Pei Shen, J. Gill","doi":"10.1109/ISIT.2001.936081","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936081","url":null,"abstract":"We propose the first single bound that supersedes Gallager's (1978) upper bound on the redundancy of binary Huffman codes with the given largest source symbol probability ranging from 0 to 0.5. We define the linear logarithm and linear logarithm entropy. We find the maximal difference between the linear and the ordinary logarithms. We prove that the \"redundancy\" of a binary Huffmann code with respect to the linear logarithm entropy is no more than the largest source symbol probability. We therefore establish a better upper bound than Gallager's on the redundancy of binary Huffman codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129978335","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
Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform 基于贪婪上下文相关顺序语法转换的高效通用无损数据压缩算法
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935941
E. Yang, Dake He
{"title":"Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform","authors":"E. Yang, Dake He","doi":"10.1109/ISIT.2001.935941","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935941","url":null,"abstract":"In many applications like compression of text files, Web page files, and Java applets, there exists some a-priori knowledge, which often takes form of context models, about the data to be compressed. The challenging problem is then how to efficiently utilize the context models to improve the compression performance. We address this problem by extending results of Yang and Kieffer (see IEEE Trans. Inform. Theory, vol.IT-46, p.755-88, 2000), particularly the greedy context-free sequential grammar transform and the corresponding compression algorithms, to the case of context models.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130462239","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
Mathematical analysis of iterative decoding of LDPC convolutional codes LDPC卷积码迭代译码的数学分析
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936054
D. Truhachev, M. Lentmaier, K. Zigangirov
{"title":"Mathematical analysis of iterative decoding of LDPC convolutional codes","authors":"D. Truhachev, M. Lentmaier, K. Zigangirov","doi":"10.1109/ISIT.2001.936054","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936054","url":null,"abstract":"Asymptotic iterative decoding performance of low-density parity-check (LDPC) convolutional codes is analyzed. An important role within the analysis is a theorem on the minimal length of cycles in the Tanner graph describing a code.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134298637","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
Minimum cross entropy control in stochastic switching systems 随机切换系统的最小交叉熵控制
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936068
A. Murgu
{"title":"Minimum cross entropy control in stochastic switching systems","authors":"A. Murgu","doi":"10.1109/ISIT.2001.936068","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936068","url":null,"abstract":"We consider a mathematical framework for switching systems of traffic streams based on the minimum cross entropy (MCE) approach. Linear models of traffic buffering processes are providing the control means through traffic splitting/merging and input-output connectivity patterns. The probabilistic description of general queueing systems deals with the stochastic flows in the switching nodes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131824615","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
Spectral graphs for quasi-cyclic LDPC codes 准循环LDPC码的谱图
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936089
R. M. Tanner
{"title":"Spectral graphs for quasi-cyclic LDPC codes","authors":"R. M. Tanner","doi":"10.1109/ISIT.2001.936089","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936089","url":null,"abstract":"Quasi-cyclic codes are described in terms of code equations on the spectral components of constituent cyclic codes. These define a constraint graph in the spectral domain. Here spectral graphs define low density parity check codes (LDPC) codes for which minimum distance can be bounded with algebraic and graph-based arguments. Examples include [42,22,8] and [155,64,20] regular LPDC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774427","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}
引用次数: 39
首页 上一页 下一页 尾页
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学术官方微信