IEEE/CAM Information Theory Workshop at Cornell最新文献_第2页

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761411

T. Han, S. Amari

{"title":"Multiterminal estimation theory","authors":"T. Han, S. Amari","doi":"10.1109/ITW.1989.761411","DOIUrl":"https://doi.org/10.1109/ITW.1989.761411","url":null,"abstract":"The basic questions here are how to construct effective encoders @,Q2 and the related estimators 6 for the parameter 0; what is the minimum variance of these estimators ?; and what is the maximum Fisher information attainable under the rate constraints RI .R2 for the Shannon information ?. etc. We shall give several substantial answers to these problems which include as special cases the previous results by Zhang and Berger, and by Ahlswede and Burnashev. The present results have been established technically on the basis of universal coding for relevant auxiliary random variables, projection operation for multivariate Gaussian statistics, introduction of a dual pair of orthogonal coordinate systems, and also geometry of Kullback-Leibler's divergences, etc. Such an approach is essentially along the differential-geometrical standpoint provided by Amari in studying the zero-rate estimators. Our estimators can be regarded as a kind of the generalized maximum-likelihood estimators of invariant form under parameter transformations, and are very naturally extended to the multi-parameter case, in contrast with those previously known estimators. As a by-product, we shall show a simple new proof to the result by Zhang and Berger, which enables us to have a clearer understanding for the additivity condition assumed by them.","PeriodicalId":413028,"journal":{"name":"IEEE/CAM Information Theory Workshop at Cornell","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408851","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

Trellis Constrained Run Length Codes 网格约束运行长度代码

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761429

M. Belongie, C. Heegard

引用次数: 0

Upper and Lower Expectations 高期望值和低期望值

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761419

Amir Sadrolhefazi, T. Fine

引用次数: 0

Computer algebra constructions of geometric codes 几何代码的计算机代数构造

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761399

M. Hassner

引用次数: 0

Polynomial Threshold Elements? 多项式阈值元素?

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761437

Jehoshua Bruck

引用次数: 0

An Information Theoretic Approach to Modeling Neural Network Expert Systems 神经网络专家系统建模的信息理论方法

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761436

R. Goodman, J. W. Miller, Padhraic Smyth

引用次数: 1

Constructions of (d, k) Codes (d, k)规范的构造

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761427

L. Frederickson

引用次数: 0

Channels with ISI Memory: Information-Theoretical Properties and Applications to Digital Magnetic Recording 具有ISI存储器的信道:信息理论特性及其在数字磁记录中的应用

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761424

W. Hirt

引用次数: 0

Summary of decoding algebraic geometry codes 解码代数几何代码摘要

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761398

S. C. Porter

{"title":"Summary of decoding algebraic geometry codes","authors":"S. C. Porter","doi":"10.1109/ITW.1989.761398","DOIUrl":"https://doi.org/10.1109/ITW.1989.761398","url":null,"abstract":"P - QS = 0 mod g. 3) Evaluate the residues of Gdz. For non-zero genus the same general program is possible, but enormous difficulties must be overcome. The first step is the description of a new finite data structure for the affine coordinate ring, permitting efficient arithmetic algorithms. To define the data structure, existence of a non-singular affine embedding with one point at infinity must be proved. . Syndrome construction and conversion of the decoding problem to a polynomial congruence is made possible by the definition of a polynomial whose divisor of zeros is exactly G and by the construction of a space of differentials which corresponds to F; and contains Q(G - D). Euclid’s algorithm is generalized for non-Euclidean affine coordinate rings. First, a generalized resultant matrix is defined. By selecting pivots in a certain order during row-reduction on the resultant matrix, objects much like remainders and convergents occur. It is proved that these objects provide minimal solutions to the polynomial congruence. 0 mod G need not be a minimal solution of 5 - S 3 0 mod G. The % error loss stems from this. Further degradation of decoding capacity occurs for some choices of the curve X, the point P, and the divisor S. The algorithm consists of efficient, easily implemented matrix operations. However, the algebraic geometry and approximation techniques necessary to develop and understand the method are both original and deep. errors in genus p.","PeriodicalId":413028,"journal":{"name":"IEEE/CAM Information Theory Workshop at Cornell","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122781719","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

Collective Oscillations and Coherent Patterns in Neural Networks Models 神经网络模型中的集体振荡和相干模式

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761440

P. Baldi

引用次数: 0