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

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

筛选
英文 中文
Information theoretic analysis of steganography 隐写术的信息理论分析
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708902
J. O’Sullivan, P. Moulin, J. M. Ettinger
{"title":"Information theoretic analysis of steganography","authors":"J. O’Sullivan, P. Moulin, J. M. Ettinger","doi":"10.1109/ISIT.1998.708902","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708902","url":null,"abstract":"Steganography is formulated as a game played between an information hider and an attacker. The cost function in this formulation is a conditional mutual information between the input and output of the attack channel given the host data set. Optimal information hiding and attack strategies are shown to correspond to optimal channel coding and data compression strategies.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"26 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":"125855591","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}
引用次数: 83
A low complexity CDMA multiuser detector-orthogonal decision-feedback detector for asynchronous CDMA systems 一种低复杂度CDMA多用户检测器——用于异步CDMA系统的正交决策反馈检测器
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708616
Hsiao-Hwa Chen
{"title":"A low complexity CDMA multiuser detector-orthogonal decision-feedback detector for asynchronous CDMA systems","authors":"Hsiao-Hwa Chen","doi":"10.1109/ISIT.1998.708616","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708616","url":null,"abstract":"This paper introduces an asynchronous orthogonal decision-feedback detector (AODFD) with its sliding-window implementation. The low complexity of the scheme is due to the use of orthogonal matched-filtering technique and short window size, together with a simple updating algorithm.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"114 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":"126972203","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
Fast and efficient construction of an unbiased random sequence 快速有效的无偏随机序列构造
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709077
B. Ryabko, E. Matchikina
{"title":"Fast and efficient construction of an unbiased random sequence","authors":"B. Ryabko, E. Matchikina","doi":"10.1109/ISIT.1998.709077","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709077","url":null,"abstract":"The problem of efficiently converting an input sequence of symbols generated by a stationary random process into a sequence of independent, equiprobable output symbols was considered by von Neumann. Elias (1972) proposed a method in which the sequence of symbols was divided into blocks of length N. Elias' method requires one to store all 2/sup N/ code words. That is why the memory size of the encoder increases exponentially when N grows. We suggest a new method of constructing an unbiased random sequence which requires the memory size of O(Nlog/sup 2/N) bits and has a time of calculation O(log/sup 3/Nloglog(N)) bit operations per letter as N/spl rarr//spl infin/.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"146 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":"116436622","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}
引用次数: 36
Finite dimensional filters for moments and stochastic integrals of the state of nonlinear Benes systems 非线性Benes系统状态的矩和随机积分的有限维滤波器
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708935
R. Elliott, V. Krishnamurthy
{"title":"Finite dimensional filters for moments and stochastic integrals of the state of nonlinear Benes systems","authors":"R. Elliott, V. Krishnamurthy","doi":"10.1109/ISIT.1998.708935","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708935","url":null,"abstract":"Finite dimensional filters for integrals and stochastic integrals of moments of the state for continuous-time nonlinear systems with Benes nonlinearity are derived. These new filters can be used with the expectation maximization (EM) algorithm to yield ML estimates of the model parameters.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"28 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":"122453354","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 properties of capacity regions in multi-user networks 多用户网络中容量区域的性质
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708814
J. Thomas
{"title":"On the properties of capacity regions in multi-user networks","authors":"J. Thomas","doi":"10.1109/ISIT.1998.708814","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708814","url":null,"abstract":"Motivated by work by Yeung (1994) on the convexity of capacity regions for a multi-user channel, we formulate the general properties of the capacity region for any network of users. In particular, in addition to the usual properties of dominance and convexity, we also consider the bit masking property that a message could be sent to a larger number of receivers than necessary. We derive a general inner bound on the capacity region of a multiuser network without feedback using these properties.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"489 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":"122751259","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
An iterative multiuser decoder for asynchronous BPSK users 用于异步BPSK用户的迭代多用户解码器
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709028
M. Moher
{"title":"An iterative multiuser decoder for asynchronous BPSK users","authors":"M. Moher","doi":"10.1109/ISIT.1998.709028","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709028","url":null,"abstract":"A multiuser decoding algorithm is presented for asynchronous BPSK users. The algorithm is derived from iterative techniques for cross-entropy minimization and has similarities with turbo decoding. Simulations show the algorithm asymptotically achieves single user performance. The complexity per bit of the decoder is O(2/sup 3K/+/sup 2/) per bit per iteration where K is the number of users and K is the constraint length of the code.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"359 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":"122764778","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}
引用次数: 11
Distortion analysis of the coding scheme based on coefficient rate 基于系数率的编码方案失真分析
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708827
Wenye Wang, J. Gibson
{"title":"Distortion analysis of the coding scheme based on coefficient rate","authors":"Wenye Wang, J. Gibson","doi":"10.1109/ISIT.1998.708827","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708827","url":null,"abstract":"Previously the authors (1997) proposed a new source coding scheme based on the investigation of Campbell's coefficient rate. This scheme can adaptively encode the transform coefficients by controlling the number of coefficients to be coded for each sample function. The image coder based on this scheme shows good performance in image compression applications. The authors analyze the rate distortion behavior of this new coder and show that this new variable rate method has advantages over coders using only a fixed quantization table, as in JPEG.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"21 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":"122808094","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
Refined Kalman smoothing for decoding real convolutional codes 改进卡尔曼平滑解码真实卷积码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708844
R. Redinbo
{"title":"Refined Kalman smoothing for decoding real convolutional codes","authors":"R. Redinbo","doi":"10.1109/ISIT.1998.708844","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708844","url":null,"abstract":"Real number convolutional codes can be corrected by time-varying smoothed Kalman estimation. The smoothing process can be truncated whenever the tracking innovations fall below a precomputed matrix norm.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"5 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114035140","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
An exploration of the relationship between the Baum-Welch algorithm and turbo decoding 探索鲍姆-韦尔奇算法和turbo解码之间的关系
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708708
Saejoon Kim, S. Wicker
{"title":"An exploration of the relationship between the Baum-Welch algorithm and turbo decoding","authors":"Saejoon Kim, S. Wicker","doi":"10.1109/ISIT.1998.708708","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708708","url":null,"abstract":"It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch algorithm provide solutions to these problems, including solutions that provide channel-matching turbo decoding algorithms.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"52 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":"122217534","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
An efficient symbol-by-symbol MAP decoding algorithm for the Golay code Golay码的一种有效的逐符号MAP解码算法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708675
L. Ping, K. L. Yeung
{"title":"An efficient symbol-by-symbol MAP decoding algorithm for the Golay code","authors":"L. Ping, K. L. Yeung","doi":"10.1109/ISIT.1998.708675","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708675","url":null,"abstract":"An efficient symbol-by-symbol soft-in/soft-out MAP decoding algorithm for the Golay code is presented based on the coset partitioning principle. Its application in the iterative decoding of concatenated Golay codes is examined. Its advantage in constructing short frame length concatenated codes is demonstrated.","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":"129722283","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学术官方微信