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

Proceedings of 1994 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
A multiuser system for the K user union channel 用于K用户联合信道的多用户系统
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394913
A. Grant, C. Schlegel
{"title":"A multiuser system for the K user union channel","authors":"A. Grant, C. Schlegel","doi":"10.1109/ISIT.1994.394913","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394913","url":null,"abstract":"A multiuser system for the K user union channel, employing N-frequency diversity is presented. The advantages of such systems in the mobile environment are considered. Certain information theoretic properties of the channel are considered. The noiseless capacity, and a useful approximation are calculated. It is then shown that the maximum capacity of such systems is N bits per channel use. Finally, a lower bound on the noisy capacity is presented.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128249781","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
Lossy Lempel-Ziv on subband coding of images 图像子带编码的有损Lempel-Ziv算法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395030
W. Finamore, M.B. de Carvalho
{"title":"Lossy Lempel-Ziv on subband coding of images","authors":"W. Finamore, M.B. de Carvalho","doi":"10.1109/ISIT.1994.395030","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395030","url":null,"abstract":"The use of a lossy Lempel-Ziv (LLZ) algorithm as the data compression stratagem on image subband coders (SBC) is discussed. Two LLZ schemes, namely LLZ/s and LLZ/d are proposed. The idea is to replace in the usual SBC, the bank of quantizers followed by Huffman encoder which are used to compress the image components at the output of the several quadrature mirror filters (QMF) or, alternatively, to replace the vector quantizer, by an LLZ. Design complexities inherent to the SBC/QH such as statistical modeling of the filters outputs and bit allocations or the vector quantizer design can be superseded by the SBC/LLZ scheme which dispenses with the knowledge of statistics of the subband being compressed. Simulation analysis of these preliminaries SBC/LLZ schemes have shown that an adequate performance, as compared to other schemes, can be obtained. The two LLZ versions proposed are described and some image compression performance rates are examined.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128492536","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}
引用次数: 8
Further results on the performance of erasure-and-error decoding rules 对擦除错误解码规则性能的进一步研究结果
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394984
T. Hashimoto
{"title":"Further results on the performance of erasure-and-error decoding rules","authors":"T. Hashimoto","doi":"10.1109/ISIT.1994.394984","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394984","url":null,"abstract":"For erasure-and-error decoding rules, a new performance measure is proposed, and threshold decision rules and the rule based on error-detecting coding are compared under the performance measure. Results are compared with simulation results.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"13 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124608657","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
A very fast method for verifying digital signatures 一种非常快速的验证数字签名的方法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395113
F. Rico, E. Sanvicente
{"title":"A very fast method for verifying digital signatures","authors":"F. Rico, E. Sanvicente","doi":"10.1109/ISIT.1994.395113","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395113","url":null,"abstract":"We consider the problem of broadcasting sensitive information to many low cost receivers when the authenticity and integrity of the received messages are the determining factors but secrecy is not important. Although several methods exist to authentify information, as a rule, they lack the asymmetry the transmission system itself exhibits. Therefore, we propose a highly non-symmetric algorithm to generate and verify digital signatures. The algorithm is based on the computation of square roots. Since valid messages have a definite structure, we address the question of choosing the factors to get around the difficulty caused by the quadratic nonresidues.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007050","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 SNR estimation algorithm using fourth-order moments 一种基于四阶矩的信噪比估计算法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394869
R. Matzner, F. Englberger
{"title":"An SNR estimation algorithm using fourth-order moments","authors":"R. Matzner, F. Englberger","doi":"10.1109/ISIT.1994.394869","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394869","url":null,"abstract":"An algorithm is presented that allows an estimation of the SNR just by the observation of the noisy signal. For the estimation, shape factors of the signal's and the noise's probability density functions are used. The algorithm is based on the second and fourth order moments of the observed noisy signal.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123847973","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}
引用次数: 103
On degeneration of correlation-immune functions 论相关免疫功能的退化
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394665
Chuankun Wu, Guo-Zhen Xiao, Xinmei Wang
{"title":"On degeneration of correlation-immune functions","authors":"Chuankun Wu, Guo-Zhen Xiao, Xinmei Wang","doi":"10.1109/ISIT.1994.394665","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394665","url":null,"abstract":"It is known that correlation-immune (CI) functions can be used in nonlinear combining generators on resisting the correlation attack. But if a CI function f(x) of n variables is degeneratable, i.e., there exists a binary matrix D of order k/spl times/n (k<n) and a Boolean function g(y) of k variables such that f(x)= g(Dx), a combining generator with f(x) as the combining function can be replaced by an equivalent generator with an undegeneratable combining function which has most probably no correlation immunity, so the undegeneratable CI functions are of advantage. Unfortunately, most CI functions constructed by the known algorithms are degeneratable. The paper is concerned with the construction of undegeneratable CI functions.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"60 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120863947","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 skew codes constructions 有效的斜码结构
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394901
S. Al-Bassam, B. Bose
{"title":"Efficient skew codes constructions","authors":"S. Al-Bassam, B. Bose","doi":"10.1109/ISIT.1994.394901","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394901","url":null,"abstract":"In communication channels consisting of many parallel sub-channels operating synchronously, the retrieval of data from all sub-channels form the message. Data can arrive at different times from the different sub-channels and it is possible that data from the next message is received before the completion of the current message. Skew detecting and tolerant codes can be used in such cases. We propose more efficient skew codes and introduce lower bounds on the number of the required check bits. The necessary and sufficient conditions for (t,d)-SD-codes are stated in the theorem given.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"420 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120878442","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
Large sets of code-sequences with good correlation properties derived from character products 从字符乘积中派生出具有良好相关性的大型代码序列集
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394734
H. Schotten, G. Berg
{"title":"Large sets of code-sequences with good correlation properties derived from character products","authors":"H. Schotten, G. Berg","doi":"10.1109/ISIT.1994.394734","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394734","url":null,"abstract":"In this paper we investigate large families of polyphase sequences which can be expressed as product of an additive and a multiplicative character. The construction of a family with size M=N(N+2) and maximum magnitude of the periodic correlation function /spl theta/~/sub max//spl les/2/spl radic/N+1 is described.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121425577","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
Second order stationary models for 1/f processes 1/f过程的二阶平稳模型
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394716
B. Yazici, R. Kashyap
{"title":"Second order stationary models for 1/f processes","authors":"B. Yazici, R. Kashyap","doi":"10.1109/ISIT.1994.394716","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394716","url":null,"abstract":"A subclass of statistically self-similar processes with correlation structure of the form E[X(t)X(t/spl lambda/)]=R(/spl lambda/) is considered. A spectral decomposition theorem for such processes is stated. Based on linear scale-invariant system theory, scale invariant autoregressive processes are developed. The proposed models are intuitive, mathematically simple and practical candidates for modeling 1/f processes.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114536710","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
Time and frequency acquisition of frequency-hopped signals with random data 随机数据跳频信号的时频采集
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394744
M. Blanco
{"title":"Time and frequency acquisition of frequency-hopped signals with random data","authors":"M. Blanco","doi":"10.1109/ISIT.1994.394744","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394744","url":null,"abstract":"A unified approach based on maximum likelihood estimation for time and frequency acquisition of frequency-hopped M-ary FSK signals with random data is presented. Algorithms for individual or joint estimation of time and frequency are derived for the cases in which: (1) the data sequence is treated as a set of nuisance parameters; (2) the data sequence is estimated along with time and frequency. These results are then extended to the case in which the channel introduces Rayleigh fading in addition to additive white Gaussian noise.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116212030","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学术文献互助群
群 号：604180095
Book学术官方微信