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

More efficient bounded-distance decoding of the Golay code and the Leech lattice 更有效的Golay码和Leech格的有界距离解码

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

F. Sun, H. van Tilborg

引用次数: 4

Identification via wiretap channels 通过窃听渠道进行身份识别

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

R. Ahlswede, Zhen Zhang

{"title":"Identification via wiretap channels","authors":"R. Ahlswede, Zhen Zhang","doi":"10.1109/ISIT.1994.394666","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394666","url":null,"abstract":"The wiretap channel can be viewed as a probabilistic model for cryptography. The channel has two outputs. One is for the legitimate receiver and the other is for the wiretapper. The goal of communication is to send messages to the legitimate receiver while the wiretapper must be kept ignorant. A wiretap channel is a quintuple (X,W(y|x),V(x|x),Y,Z), where X is the input alphabet, Y is the output alphabet for the legitimate receiver, Z is the output alphabet for the wiretapper, W(y|x) is the channel transition matrix, whose output is available to the legitimate receiver, and V(x|x) is the channel transition matrix, whose output is available to the wiretapper. The channel is assumed to be memoryless. In the classical transmission problem, an (n,M,/spl epsi/)-code for the wiretap channel is defined as a system {(c/sub i/,D/sub i/)|1/spl les/i/spl les/M}, where, for all i,c/sub i//spl isin/X/sup n/ are the codewords and D/sub i//spl sub/y/sup n/ are the disjoint decoding sets. It is required that for any i /spl lambda//sub i/=/sup def/W/sup n/(D/sub i//sup c/|c/sub i/)/spl les//spl epsi/, and if X/sup n/ has uniform distribution over {c/sub i/|/spl les/i/spl les/M}, then 1/nI(X/sup n/;Z/sup n/)/spl les//spl epsi/. The secret capacity of the wiretap channel is defined as the maximum rate of any code which satisfies these conditions. Formally, let M(n,/spl epsi/)=max{M:/spl exist/a(n,M,/spl epsi/) code}, then the secret capacity of the wiretap channel is defined as C/sub s/=max{R:/spl forall//spl epsi/>0,/spl exist/n such that M(n,C)/spl ges//sup nR/. The secret capacity of the wiretap channel can then be determined. The problem of identification via this channel is then formulated.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"348 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":"133275925","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 computer search for good quasi-cyclic codes 好的准循环码的计算机搜索

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

Zhi Chen

引用次数: 3

The state complexity of trellis diagrams for a class of generalized concatenated codes 一类广义连接码格图的状态复杂度

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

T. Fujiwara, T. Kasami, R. Morelos-Zaragoza, Shu Lin

引用次数: 7

Design and analysis of a DPCM system with a switched quantizer 带开关量化器的DPCM系统的设计与分析

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

Shay-Jan Huang, L. Davisson

引用次数: 1

Overlay coding technique for supporting high data rates for DS-CDMA systems 支持DS-CDMA系统高数据速率的覆盖编码技术

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

E. Zehavi

引用次数: 2

Exponentiation-based key generation using noncommutative groups 使用非交换群生成基于幂次的密钥

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

V. Sidelnikov

{"title":"Exponentiation-based key generation using noncommutative groups","authors":"V. Sidelnikov","doi":"10.1109/ISIT.1994.395112","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395112","url":null,"abstract":"Diffie and Hellman (1976) proposed to use exponentiation module a prime for constructing the key generation system. A security of this system is based on the supposed hardness of the following problem (A): given /spl eta//sup x/ and /spl eta//sup y/ compute /spl eta//sup xy/. Sidelnikov, Cherepniov, and Yaschenko (1993) considered a system based on the noncommutative group G. We assume that G is a certain subgroup of the group GL/sub n/(F/sub p/) of n/spl times/n matrices over the finite field F/sub p/. We consider the representation of the group GL/sub n/(F/sub p/) with the aid of exponentiation in a subsidiary cyclic group U of order p and investigate of the security of the resulting key generation systems. The group of F/sub q/-rational point on elliptic curve and the subgroup U= of the multiplicative group of the subsidiary finite field F/sub q/, where p|q-1, /spl eta//spl isin/F/sub q/, /spl eta//sup p/=1, /spl eta//spl ne/1, are the examples of the group U. We consider the group /spl Uscr/ of affine transformations of the field F/sub p/ which is isomorphic to a certain subgroup of GL/sub 2/(F/sub p/). In this case the security of the key generation system under certain conjecture (which simplifies the task of adversary) is based on the hardness of the following problem (B): given /spl eta//sup x/,/spl eta//sup y/,/spl beta//sup z/ compute /spl eta//sup xy/z/. It seems impossible reduce this problem to several Diffie-Hellman problems (A). The system being considered uses a universal key, which does not exist in the Diffie-Hellman system and is presumably a new element for key generation systems. The knowledge of k is supposed to be a necessary condition to compute the private key.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"42 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":"116023878","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 the trellis structure of block codes 论分组码的格子结构

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

F. Kschischang, V. Sorokine

引用次数: 191

Stationary random functions and periodic clock changes 平稳随机函数和周期性时钟变化

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

B. Lacaze, N. Aakvaag

引用次数: 1

A reliable signal detection method for the combination of PRML method and ternary recording code 一种可靠的PRML方法与三进制记录码相结合的信号检测方法

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

S. Tazaki, T. Takashima, S. Tsuzuki, Y. Yamada

引用次数: 0