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

On the information rate of perfect secret sharing schemes 论完美秘密共享方案的信息率

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

M. van Dijk

引用次数: 19

Minimal cryptosystems and defining subliminal-freeness 最小密码系统和定义阈下自由

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

Y. Desmedt, M. Yung

引用次数: 6

Repeated communication and Ramsey graphs 重复交流和拉姆齐图

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

N. Alon, A. Orlitsky

{"title":"Repeated communication and Ramsey graphs","authors":"N. Alon, A. Orlitsky","doi":"10.1109/ISIT.1994.394703","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394703","url":null,"abstract":"Studies the savings afforded by repeated use in two zero-error communication problems. 1. Channel coding: proving a correspondence between Ramsey numbers and independence numbers of normal graph powers, the authors show that some channels can communicate exponentially more bits in two uses than they can in one use, and that this is essentially the largest possible increase. Using probabilistic constructions of self-complementary Ramsey graphs, the authors show that similar results hold even when the number of transmissible bits is large relative to the channel's size. 2. Dual-source coding: using probabilistic colorings of directed line graphs, the authors show that there are dual sources where communicating one instance requires arbitrarily many bits, yet communicating many instances requires at most two bits per instance. For dual sources where the number of bits required for a single instance is comparable to the source's size, they employ probabilistic constructions of self-complementary Ramsey graphs that are also Cayley graphs to show that conveying two instances may require only a logarithmic number of additional bits over that needed to convey one instance.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 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":"125693321","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}

引用次数: 80

Prefixes and the entropy rate for long-range sources 长程源的前缀和熵率

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

Ioannis Kontoyiannis, Y. Suhov

引用次数: 41

Optimal detection based on adaptive array antenna in spatial and temporal domains 基于自适应阵列天线的空域和时域最优检测

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

R. Kohno, M. Nagatsuka, H. Imai

引用次数: 1

A Bayes coding algorithm using context tree 使用上下文树的贝叶斯编码算法

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

T. Matsushima, S. Hirasawa

引用次数: 12

Efficacy of adaptive signal processing algorithms 自适应信号处理算法的有效性

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

G. Moustakides

引用次数: 1

Inferring probabilistic acyclic automata using the minimum description length principle 利用最小描述长度原理推断概率无循环自动机

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

Y. Singer, Naftali Tishby

引用次数: 3

Subliminal-free sharing schemes 无意识的共享计划

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

Y. Desmedt

引用次数: 5

Performance analysis of overlapping multi-pulse pulse position modulation (OMPPM) in noisy photon counting channel 噪声光子计数信道中重叠多脉冲脉冲位置调制(OMPPM)性能分析

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

T. Ohtsuki, I. Sasase, S. Mori

引用次数: 3