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

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)最新文献

筛选
英文 中文
On the robustness of turbo decoders turbo解码器的鲁棒性研究
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708740
Xiaoling Huang, N. Phamdo
{"title":"On the robustness of turbo decoders","authors":"Xiaoling Huang, N. Phamdo","doi":"10.1109/ISIT.1998.708740","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708740","url":null,"abstract":"This paper investigates the sensitivity of turbo decoder performance to mismatch of the noise distribution and proposes a simple on-line procedure for estimating the unknown noise distribution from each block of received signal. For Gaussian and Laplacian noise, the proposed procedure leads to decoder performances which are comparable (within 0.1 dB) to the case where the noise distribution is known exactly.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128280176","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
Identity-based non-interactive key sharing equivalent to RSA public-key cryptosystem 基于身份的非交互式密钥共享，相当于RSA公钥密码系统
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708989
H. Tanaka
{"title":"Identity-based non-interactive key sharing equivalent to RSA public-key cryptosystem","authors":"H. Tanaka","doi":"10.1109/ISIT.1998.708989","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708989","url":null,"abstract":"A new simply implemented identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. The security depends on the difficulty of factoring and is equivalent to RSA public-key cryptosystem even when the collusion among users is performed. The center algorithm is very simple and easily implemented. The extension to a common-key sharing scheme among multi-users is also possible.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128379247","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
Prequential and cross-validated mixture regression estimation 先验和交叉验证混合回归估计
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708964
D.S. Modha, E. Masry
{"title":"Prequential and cross-validated mixture regression estimation","authors":"D.S. Modha, E. Masry","doi":"10.1109/ISIT.1998.708964","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708964","url":null,"abstract":"Prequential model selection and cross-validation are data-driven methodologies for selecting a single \"best\" model from a collection of competing models. In contrast, we propose prequential and cross-validated mixtures which are suitably weighted combinations of all the rival models under consideration. We empirically study prequential and cross-validated mixtures (both based on neural networks) for regression estimation.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128578140","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
A differential Viterbi algorithm for decoding rate-1/n doubly complementary convolutional codes and their high-rate punctured codes based on a compare-select-add principle 基于比较-选择-相加原理的译码率为1/n的双互补卷积码及其高速率穿孔码的差分Viterbi算法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708970
Shu Lin, M. Fossorier
{"title":"A differential Viterbi algorithm for decoding rate-1/n doubly complementary convolutional codes and their high-rate punctured codes based on a compare-select-add principle","authors":"Shu Lin, M. Fossorier","doi":"10.1109/ISIT.1998.708970","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708970","url":null,"abstract":"This paper presents a new algorithm for decoding doubly complementary convolutional codes based on a compare-select-add principle to process the code trellis. This new algorithm is more efficient than the conventional Viterbi (1967) algorithm.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124586323","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
On the asymptotics of the minimax redundancy arising in a universal coding 通用编码中极大极小冗余的渐近性
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708954
W. Szpankowski
{"title":"On the asymptotics of the minimax redundancy arising in a universal coding","authors":"W. Szpankowski","doi":"10.1109/ISIT.1998.708954","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708954","url":null,"abstract":"Let x/sup n/ denote a sequence built over a finite alphabet A, and let P(x/sup n/;w) be the probability of x/sup n/ generated by the source w. We define a uniquely decodable code /spl phi/(x/sup n/) of length |/spl phi/(x/sup n/)|=-logQ(x/sup n/) where Q(/spl middot/) is an arbitrary probability distribution on A/sup n/. The cumulative redundancy of the encoding x/sup n/ at the output of a source w is defined as p(x/sup n/;/spl phi//sub n/,w):=-logQ(x/sup n/)+logP(x/sup n/). Finally, let us consider a set of sources /spl Omega/, and define the minimax redundancy as p/sub n/(/spl Omega/):=inf/sub /spl phi/n/sup/sub w/spl isin//spl Omega//max/sub xn/spl isin/An/{p(x/sup n/;/spl phi//sub n/,w)}. We study asymptotically /spl rho//sub n/(/spl Omega/) for memoryless sources via analytic methods.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126667638","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 block entropy coding with low complexity 高效、低复杂度的块熵编码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708731
A. Said, W. Pearlman, A. Islam
{"title":"Efficient block entropy coding with low complexity","authors":"A. Said, W. Pearlman, A. Islam","doi":"10.1109/ISIT.1998.708731","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708731","url":null,"abstract":"Efficient low-complexity block entropy coding requires careful exploitation of specific data characteristics to circumvent the practical difficulties associated with large alphabets. Two recent image coding methods, alphabet and group partitioning (AGP) and set partitioning in hierarchical trees (SPIHT) can be viewed as block entropy coding methods, which are successful because of the manner in which they partition the alphabet into sets and encode these sets very efficiently. Here we present analysis and numerical results to show that AGP and SPIHT are indeed efficient block entropy coders.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129231095","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
Unconditionally secure dynamic conference key distribution 无条件安全的动态会议密钥分发
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708988
Y. Desmedt, Vaidhyanathan Viswanathan
{"title":"Unconditionally secure dynamic conference key distribution","authors":"Y. Desmedt, Vaidhyanathan Viswanathan","doi":"10.1109/ISIT.1998.708988","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708988","url":null,"abstract":"We present a non-interactive conference key distribution protocol in which all n users receive initial secrets from a trusted server. When a subset of the n users want to communicate privately, each of the users involved can without interaction compute the common key. We prove that the length of the initial secrets we use, are optimal.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124182362","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}
引用次数: 24
Generalized concatenated codes based on tamed frequency modulation 基于驯服调频的广义级联码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708941
M. Bossert, A. Hautle, H. Dieterich, S. Shavgulidze
{"title":"Generalized concatenated codes based on tamed frequency modulation","authors":"M. Bossert, A. Hautle, H. Dieterich, S. Shavgulidze","doi":"10.1109/ISIT.1998.708941","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708941","url":null,"abstract":"Using the principles of generalized concatenation we introduce a new design for encoded TFM. New constructions are based on inner nested (sub)systems of TFM signals and outer convolutional codes.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124247134","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
Acceleration of the EM algorithm via proximal point iterations 通过近点迭代加速EM算法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709049
S. Chrétien, A. Hero
{"title":"Acceleration of the EM algorithm via proximal point iterations","authors":"S. Chrétien, A. Hero","doi":"10.1109/ISIT.1998.709049","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709049","url":null,"abstract":"In this paper, a class of proximal point methods using the Kullback information measure is introduced. In particular, the EM algorithm is proved to belong to this class. A novel relaxation of the EM algorithm is proposed along with implementation strategies. Superlinear convergence of these methods is established.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124253150","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
Classical capacity of quantum channels, coherent quantum information and quantum privacy 量子信道的经典容量、相干量子信息和量子隐私
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708672
B. Schjumacher, M. D. Westmorland
{"title":"Classical capacity of quantum channels, coherent quantum information and quantum privacy","authors":"B. Schjumacher, M. D. Westmorland","doi":"10.1109/ISIT.1998.708672","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708672","url":null,"abstract":"We derive a relation between a quantum channel's capacity to convey classical information and its ability to convey quantum information. This relation is applied to the analysis of the privacy of a quantum channel.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500064","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
首页 上一页 下一页 尾页
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学术官方微信