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

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

筛选
英文 中文
Error correcting codes on periodically disturbed data channels 周期性扰动数据信道上的纠错码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394938
N. Lange
{"title":"Error correcting codes on periodically disturbed data channels","authors":"N. Lange","doi":"10.1109/ISIT.1994.394938","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394938","url":null,"abstract":"The paper introduces the \"periodically disturbed data channel\" (PDC) and some of its characteristics from the coding theoretical point of view. After defining an error model, the error detection conditions using cyclic codes are derived. Furthermore, two methods of error correction for this error model are examined. One is the use of a multiparameter burst error correcting code, the other one applies a cyclic code based on self-dual polynomials. For both methods a decoding strategy is developed.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"6 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":"126458802","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
Shared buffering in nonblocking copy networks 非阻塞复制网络中的共享缓冲
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395024
M. Hegde
{"title":"Shared buffering in nonblocking copy networks","authors":"M. Hegde","doi":"10.1109/ISIT.1994.395024","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395024","url":null,"abstract":"This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, the delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and feed channel priority wherein there exists a certain priority among input channels.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"23 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":"125747277","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
Improved redundancy of a version of the Lempel-Ziv algorithm 改进了一个版本的Lempel-Ziv算法的冗余
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394962
A. Wyner, A. Wyner
{"title":"Improved redundancy of a version of the Lempel-Ziv algorithm","authors":"A. Wyner, A. Wyner","doi":"10.1109/ISIT.1994.394962","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394962","url":null,"abstract":"The fixed-database Lempel-Ziv algorithm (FDLZ) closely resembles practical versions of the LZ algorithm that are widely in use. Bender and Wolf (1991) suggested a variant of LZ which empirically appears to perform well. We suggest a finite memory version of their scheme, and show that it has redundancy /spl rho//sub n/=O(1/log n) where n is the memory size. We are concerned with a data source which is a stationary, finite-memory random sequence that takes values in an alphabet of finite size A. The data source can be losslessly encoded using (H+/spl rho//sub n/) bits per source symbol, where n is a measure of the complexity of the code, and /spl rho//sub n//spl rarr/0, as n/spl rarr//spl infin/. The LZ algorithm is a universal procedure (which does not depend on the source statistics) for encoding the source at a rate close to the entropy.<<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":"122231019","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}
引用次数: 42
Typical sequences and all that: entropy, pattern matching, and data compression 典型的序列和所有这些:熵、模式匹配和数据压缩
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394969
A. Wyner
{"title":"Typical sequences and all that: entropy, pattern matching, and data compression","authors":"A. Wyner","doi":"10.1109/ISIT.1994.394969","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394969","url":null,"abstract":"The author applies pattern matching results to three problems in information theory. The characterisation of a probability law is also discussed.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"108 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":"127965976","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}
引用次数: 16
On orthogonal wavelets with oversampling property 具有过采样性质的正交小波
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394819
X. Xia, Zhen Zhang
{"title":"On orthogonal wavelets with oversampling property","authors":"X. Xia, Zhen Zhang","doi":"10.1109/ISIT.1994.394819","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394819","url":null,"abstract":"Considers the orthogonal scaling functions with the following general oversampling property: for a fixed integer J/spl ges/0 and any f/spl isin/V/sub 0/, f(t)=/spl Sigma//sub n/f(n/(2/sup J/))/spl phi/(2/sup J/t-n). The authors call that an orthogonal scaling function /spl phi/(t) satisfying the above equation has the oversampling property with sampling rate 2/sup -J/ and denote all such scaling functions by S/sub J/. Thus, S/sub 0/ consists of all orthogonal scaling functions with the sampling property and S/sub J/ /spl sub/S/sub J+1/ for J=0, 1, 2, .... The results in Walter (1993) also show that S/sub 0//spl ne/S/sub 1/, i.e., the space of the orthogonal scaling functions with the sampling property is a proper subspace of the one of the orthogonal scaling functions with the oversampling property. Let S/sub e/ and S/sub c/ denote all orthogonal scaling functions with exponential decay and compact support, respectively. The present authors prove that S/sub 0//spl cap/S/sub e/=S/sub J//spl cap/S/sub e/ and S/sub 0//spl cap/S/sub c/=S/sub J//spl cap/S/sub c/.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"314 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":"132019007","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 combined synchronization and error control coding 结合同步和错误控制编码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394908
G. Kabatjanskii, A. Vinck, A. van Wijngaarden
{"title":"On combined synchronization and error control coding","authors":"G. Kabatjanskii, A. Vinck, A. van Wijngaarden","doi":"10.1109/ISIT.1994.394908","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394908","url":null,"abstract":"We investigate the performance of error-control coding in the presence of a special type of errors induced by the bit-stuffing procedure in frame oriented transmission. Certain single substitution errors cause an additional insertion or deletion in the received data frame. We construct a class of systematic codes of variable length that correct single insertion/deletion errors and single substitution errors. The error detection capability of this class of codes is determined by simulation and compared with the traditional CRC-16 error detection code.<<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":"132527791","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
Polyphase sequences with good periodic and aperiodic autocorrelations 具有良好的周期和非周期自相关的多相序列
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394896
P.Z. Fan, M. Darnell, B. Honary
{"title":"Polyphase sequences with good periodic and aperiodic autocorrelations","authors":"P.Z. Fan, M. Darnell, B. Honary","doi":"10.1109/ISIT.1994.394896","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394896","url":null,"abstract":"Polyphase sequences with ideal periodic autocorrelation functions and favorable aperiodic autocorrelation functions are considered. The properties of such polyphase sequences are studied. It is proved that there exist other Golomb (1965) sequences of length L whose maximum out-of-phase value is bounded by /spl radic/(L/c), where c is an positive number.<<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":"134061101","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
Polynomial of correctable patterns of product codes 产品代码的可校正模式的多项式
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394985
N. Sendrier
{"title":"Polynomial of correctable patterns of product codes","authors":"N. Sendrier","doi":"10.1109/ISIT.1994.394985","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394985","url":null,"abstract":"Product codes have a poor minimum distance, but an efficient low-complexity decoding algorithm. To measure the performance of a decoder, like Reddy-Robinson's for product codes, which decode error patterns beyond half the minimum distance, we use the notion of equivalent diameter of the decoding region [4]. We produce here a bound for the performance of product code which is, for the considered example, far below the simulated performance but still above the performance of known BCH codes with same parameters.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"23 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":"133934382","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
Locally optimum distributed detection of dependent random signals based on ranks 基于秩的相关随机信号的局部最优分布检测
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394993
Rick S. Blum
{"title":"Locally optimum distributed detection of dependent random signals based on ranks","authors":"Rick S. Blum","doi":"10.1109/ISIT.1994.394993","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394993","url":null,"abstract":"Distributed signal detection schemes based on observations which are dependent from sensor to sensor are studied. Cases where weak random signals are observed in possibly non-Gaussian additive noise are considered. The focus is on cases where the sensor tests are based only on the ranks and signs of the observations. We find analytical forms for the best (locally optimum) sensor test statistics for such cases, and we use these to find the best distributed detection schemes for some cases.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"54 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":"131068388","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}
引用次数: 5
A unified approach for construction of rotationally invariant MTCM 一种构造旋转不变MTCM的统一方法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395059
P. Bobrek, V. Jain
{"title":"A unified approach for construction of rotationally invariant MTCM","authors":"P. Bobrek, V. Jain","doi":"10.1109/ISIT.1994.395059","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395059","url":null,"abstract":"Using the results of Forney's (1988) squaring construction, this paper integrates the rotationally invariant multidimensional trellis coded modulation (MTCM) construction schemes of Wei (1987) and Pietrobon (IEEE Trans. Info. Theory, vol.IT-39, no.3, p. 325-336, 1993), et al. into a highly efficient construction procedure. This procedure can be used to construct QAM or MPSK based MTCM schemes. This paper demonstrates that the squaring construction allows us to deduce the coset representatives of a multidimensional constellation directly from a 2-D partition. A method is given for generating and ordering the coset representatives for rotationally invariant MTCM schemes.<<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":"130713676","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
首页 上一页 下一页 尾页
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学术官方微信