Proceedings of 1994 IEEE International Symposium on Information Theory最新文献_第2页

Correlation properties of Chebyshev binary/bit sequences 切比雪夫二进制/位序列的相关特性

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.394894

T. Kohda, A. Tsuneda

引用次数: 2

Finite-precision source resolvability 有限精度源解析性

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.394722

Y. Steinberg, S. Verdú

{"title":"Finite-precision source resolvability","authors":"Y. Steinberg, S. Verdú","doi":"10.1109/ISIT.1994.394722","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394722","url":null,"abstract":"The paper studies the minimum randomness necessary for finite precision simulation of a random source. In random process simulation, the objective of the simulator is to approximate a set of desired statistics. To this end, the simulator has access to a source of pure random bits-a random number generator-and the approximation is achieved by properly mapping the output of the random number generator to the alphabet of the approximated process. An important question that arises is what is the number of pure random bits per source output that the most efficient simulation scheme needs in order to produce every sample path of the approximating process. The answer to this question depends on the statistics of the approximated source and on the sense of approximation. If the objective was to produce-with the aid of only pure random bits-exactly the same statistics (distributions) as that of the desired process, then one could only simulate finite alphabet random processes whose statistics admit finite binary representations. For example, an exact simulation of a binary process with irrational probabilities is not feasible, since the number of fair bits per source output required for accurate simulation is infinite.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128958813","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

The resolvability and the capacity of AWGN channels are equal AWGN信道的可分辨性和容量相等

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.395078

Te Sun Han, S. Verdú

引用次数: 8

Bits through queues 通过队列的比特

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.394647

V. Anantharam, S. Verdú

引用次数: 316

Asymptotically optimal function estimation by minimum complexity criteria 基于最小复杂度准则的渐近最优函数估计

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.394933

A. Barron, Yuhong Yang, Bin Yu

引用次数: 27

On block coded ARQ schemes cumulating the rejected sequences 在分组编码ARQ方案中累积被拒绝的序列

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-12-01 DOI: 10.1109/ISIT.1994.394643

T. Niinomi, T. Matsushima, S. Hirasawa

引用次数: 0

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding 源编码定理中的收敛速度，经验量化器设计，以及通用有损源编码

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-11-01 DOI: 10.1109/ISIT.1994.395069

T. Linder, G. Lugosi, K. Zeger

{"title":"Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding","authors":"T. Linder, G. Lugosi, K. Zeger","doi":"10.1109/ISIT.1994.395069","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395069","url":null,"abstract":"Rates of convergence results are established for vector quantization. Convergence rates are given for an increasing vector dimension and/or an increasing training set size. In particular, the following results are shown for memoryless real valued sources with bounded support at transmission rate R. (1) If a vector quantizer with fixed dimension k is designed to minimize the empirical MSE with respect to m training vectors, then its MSE for the true source converges almost surely to the minimum possible MSE as O(/spl radic/(log m/m)); (2) The MSE of an optimal k-dimensional vector quantizer for the true source converges, as the dimension grows, to the distortion-rate function D(R) as O(/spl radic/(log k/k)); (3) There exists a fixed rate universal lossy source coding scheme whose per letter MSE on n real valued source samples converges almost surely to the distortion-rate function D(R) as O(/spl radic/(log log n/log n)); and (4) Consider a training set of n real valued source samples blocked into vectors of dimension k, and a k-dimensional vector quantizer designed to minimize the empirical MSE with respect to the m=[n/k] training vectors. Then the MSE of this quantizer for the true source converges almost surely to the distortion-rate function D(R) as O(/spl radic/(log log n/log n)), if one chooses k=[1/R(1-/spl epsiv/)(log n)] /spl forall//spl epsiv/ /spl epsiv/(0,1).<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1667 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338632","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}

引用次数: 130

Variable-rate source coding theorems for stationary nonergodic sources 平稳非遍历源的变速率源编码定理

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-11-01 DOI: 10.1109/ISIT.1994.395006

M. Effros, P. Chou, R. Gray

引用次数: 22

A lower bound on the expected length of one-to-one codes 一对一码的期望长度的下界

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-09-01 DOI: 10.1109/ISIT.1994.394765

N. Alon, A. Orlitsky

引用次数: 53

Bounds on achievable convergence rates of parameter estimators via universal coding 通用编码下参数估计器可实现收敛率的界

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-07-01 DOI: 10.1109/ISIT.1994.394935

N. Merhav

引用次数: 1