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

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

筛选
英文 中文
Exact computations for queueing network performance using piecewise-deterministic Markov models 使用分段确定性马尔可夫模型对排队网络性能进行精确计算
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395020
M.H.A. Davis, J. M. Howl
{"title":"Exact computations for queueing network performance using piecewise-deterministic Markov models","authors":"M.H.A. Davis, J. M. Howl","doi":"10.1109/ISIT.1994.395020","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395020","url":null,"abstract":"This paper presents efficient algorithms for exact calculation of queueing system stationary distributions and finite-time performance, based on piecewise-deterministic Markov models. The M/D/1 and M/D/2 queues are given as examples.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"117 3 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":"115318324","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
Density/length profiles and trellis complexity of linear block codes and lattices 线性分组码和格的密度/长度轮廓和网格复杂性
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394679
G. Forney
{"title":"Density/length profiles and trellis complexity of linear block codes and lattices","authors":"G. Forney","doi":"10.1109/ISIT.1994.394679","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394679","url":null,"abstract":"The dimension/length profile (DLP) of a linear code C is equivalent to its generalized Hamming weight (GHW) hierarchy. The trellis complexity of C is intimately related to its DLP; indeed, these two topics should be regarded as parts of the same subject. Using this concept,easy proofs of unknown results and some new results are given. An analogous concept is introduced for lattices, the density/length profile (DLP). Analogous results are derived, which however look quite different.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"57 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":"115662764","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
Performance of adaptive MLSE equalization on multipath fading channels with imperfect channel estimates 不完全信道估计下多径衰落信道的自适应MLSE均衡性能
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394661
M. Chiu, Chi-chao Chao
{"title":"Performance of adaptive MLSE equalization on multipath fading channels with imperfect channel estimates","authors":"M. Chiu, Chi-chao Chao","doi":"10.1109/ISIT.1994.394661","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394661","url":null,"abstract":"In the literature, the performance of maximum-likelihood sequence estimation (MLSE) equalization on multipath fading channels is analysed under the assumption of perfect channel estimates. In reality, this condition is difficult to attain, especially for fast fading channels. It is therefore of great significance to study the performance degradation due to imperfect channel estimates. In this paper, we consider a practical MLSE equalizer in conjunction with a least mean square (LMS) channel estimator and a simple channel predictor. A new upper-bound on block error rate is derived for multipath Rayleigh fading channels.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 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":"123132840","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
Gambling for the mnemonically impaired 为失忆者准备的赌博
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394788
J. Roche
{"title":"Gambling for the mnemonically impaired","authors":"J. Roche","doi":"10.1109/ISIT.1994.394788","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394788","url":null,"abstract":"Describes a simple game of chance designed to test a player's memory, and determines how well one can play the game with a limited memory. In the extreme case of a one-bit memory, the results settle a question raised by Komlos et al. and resolve two related questions left open by Venkatesh and Franklin (1991).<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"69 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":"114658410","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
Trace description of q-ary linear codes q元线性码的跟踪描述
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394926
Jean-Pierre Zanotti
{"title":"Trace description of q-ary linear codes","authors":"Jean-Pierre Zanotti","doi":"10.1109/ISIT.1994.394926","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394926","url":null,"abstract":"J. Wolfmann (see A.A.E.C.C., vol.2, p.119, 1991) gives a description of projective binary linear codes by means of a polynomial. The purpose of our work is first to generalize such a description to q-ary codes. Then the main difficulty is to evaluate the weights of these codes and it is not possible to follow the same method as in the binary case. We consider Artin-Schreier curves and we give a bound on weights. Some normalization are also investigated.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"19 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":"125209449","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 generalized distances 关于广义距离
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394709
G. Cohen, S. Litsyn, G. Zémor
{"title":"On generalized distances","authors":"G. Cohen, S. Litsyn, G. Zémor","doi":"10.1109/ISIT.1994.394709","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394709","url":null,"abstract":"We derive new asymptotic bounds for generalized distances. Our approach extends the classical Hamming, Plotkin and Elias bounds. The latter bound involves extending the definition of generalized distances to non-linear codes.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"29 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":"116703523","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
Multirate achievability in memoryless multiaccess channel 无存储器多址信道中的多速率可达性
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394912
R. Cheng
{"title":"Multirate achievability in memoryless multiaccess channel","authors":"R. Cheng","doi":"10.1109/ISIT.1994.394912","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394912","url":null,"abstract":"The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"25 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":"116867459","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
(T, U) mapping matrices: properties and applications in permutation decoding (T, U)映射矩阵:性质及其在置换译码中的应用
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394887
Ming-ru Jia, A. Benyamin-Seeyar, T. Le-Ngoc
{"title":"(T, U) mapping matrices: properties and applications in permutation decoding","authors":"Ming-ru Jia, A. Benyamin-Seeyar, T. Le-Ngoc","doi":"10.1109/ISIT.1994.394887","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394887","url":null,"abstract":"Properties of mapping matrices which define the connection of the /spl gamma/-type error patterns in different domains are presented. Using their properties, we can define the capability of the s-step (T, U) permutation decoding method. These properties can also be extended to other permutation decoding methods which use the elements other than p (the characteristic of GF(q)) as multipliers.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"85 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":"120810341","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
An algorithm for nonparametric forecasting for ergodic, stationary time series 一种遍历平稳时间序列的非参数预测算法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395052
S. Yakowitz, L. Gyorfi, G. Morvai
{"title":"An algorithm for nonparametric forecasting for ergodic, stationary time series","authors":"S. Yakowitz, L. Gyorfi, G. Morvai","doi":"10.1109/ISIT.1994.395052","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395052","url":null,"abstract":"The authors discuss doubly infinite stationary ergodic time series and sequences. The pattern recognition problem is considered as is the classification problem. Probabilities of misclassification and Bayes methods are mentioned.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"31 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120922058","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
Dynamic channel resource allocation in frequency hopped wireless communication systems 跳频无线通信系统中的动态信道资源分配
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394739
C.C. Wang, G. Pottie
{"title":"Dynamic channel resource allocation in frequency hopped wireless communication systems","authors":"C.C. Wang, G. Pottie","doi":"10.1109/ISIT.1994.394739","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394739","url":null,"abstract":"In a conventional TDMA wireless system, the blocking probability is affected by the worst case interference statistics. Modifying the system to a frequency-hopped CDMA (CDMA-FH) system can change the blocking probability to be determined by average statistics. Hopping patterns can be implemented easily using Latin squares. A system using Latin squares of size n guarantees no users in the same cell share any slots and a user and all users in different cells share only one out of every n slots. Channel coding over hops then suppresses the worst interference. Further improvements may be obtained by allowing users to occupy M out of N slots where M/spl les/N. Centralized and distributed dynamic channel allocation (DCA) algorithms which allow users to have different SIR requirements have been developed to maximize the capacity of the system under a desired blocking probability.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"22 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":"127444646","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
首页 上一页 下一页 尾页
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学术官方微信