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

On quadratic m-sequences 关于二次m序列

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394654

A. Chan, R. Games, J. Rushanan

引用次数: 15

An asymptotic result for large capacity circuit-switched networks 大容量电路交换网络的一个渐近结果

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395023

Ezhan Karasan, J. Hui

引用次数: 0

Decoding of a Cartesian product set with a constraint on an additive cost; fixed-rate entropy-coded vector quantization 附加代价约束下笛卡尔积集的解码固定速率熵编码矢量量化

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394701

A. Khandani

{"title":"Decoding of a Cartesian product set with a constraint on an additive cost; fixed-rate entropy-coded vector quantization","authors":"A. Khandani","doi":"10.1109/ISIT.1994.394701","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394701","url":null,"abstract":"The authors consider a discrete set of points A composed of K=|A| elements. A non-negative cost c(a) is associated with each element a/spl isin/A. The n-fold Cartesian product of A is dented as {A}/sup n/. The cost of an n-fold element a=(a/sub 0/, ..., a/sub n-1/)/spl isin/{A}/sup n/ is equal to: c(a)=/spl Sigma//sub i/ c(a/sub i/). The authors select a subset of the n-fold elements, S/sub n//spl isin/{A}/sup n/, with a cost less than or equal to a given value c/sub max/. They refer to A as the constituent subset. They consider another set of n-tuples X/sub n/ denoted as the input set. A non-negative distance is defined between each x=(x/sub 0/, ..., x/sub n-1/)/spl isin/X/sub n/, and each s=(s/sub 0/, ..., s/sub n-1/)/spl isin/S/sub n/. The distance between x/sub i/ and s/sub i/ is denoted as d(x/sub i/,s/sub i/). The distance between x and s is equal to: d(x,s)=/spl Sigma//sub i/d(x/sub i/, s/sub i/). Decoding of an element x/spl isin/X/sub n/ is to find the element s/spl isin/S/sub n/ which has the minimum distance to x. A major application of this decoding problem is in fixed-rate entropy-coded vector quantization where A is the set of reconstruction vectors of a vector quantizer and cost is equivalent to self-information.<<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":"114775885","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

On the formal duals of Kerdock codes 论Kerdock码的形式对偶

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395043

C. Carlet

引用次数: 0

Tiling with polyominoes under modular arithmetic and distance criteria 模算法和距离准则下的多项式平铺

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394880

R. Palazzo, C. de Almeida

引用次数: 0

On the classification of the tight spherical designs 论紧密球形设计的分类

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394882

P. Boyvalenkov

引用次数: 1

A posteriori probabilities and performance evaluation of trellis codes 网格代码的后验概率与性能评价

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394683

Hans-Andrea Loeliger

引用次数: 14

Reduction of the numerical range of the state metrics in a Viterbi decoder 减小维特比解码器中状态度量的数值范围

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394804

A.P. Hekstra

引用次数: 1

New bounds on convolutional code performance over fading channels 衰落信道下卷积码性能的新界限

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395010

R.D. Cideciyan, E. Eleftherion

引用次数: 14

An adaptive hybrid ARQ scheme based on exponentially weighted moving averages for slowly time-varying communication channels 基于指数加权移动平均的慢时变通信信道自适应混合ARQ方案

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394642

A. T. Memişoğlu, S. Bilgen

引用次数: 0