APPLICATIONS OF CODING THEORY TO COMMUNICATION COMBINATORIAL PROBLEMS

被引:13
作者
COHEN, GD
机构
[1] Ecole Nationale Supérieure des Télécommunications, Paris, 75634 Cedex 13
关键词
D O I
10.1016/0012-365X(90)90009-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We present a survey and a few results on the use of techniques borrowed from coding theory for solving combinatorial questions originating in communication problems. We will mainly deal with the three following topics: • conflict resolution with feedback in multiple access channels, • coding for memories with defects, • writing on reluctant memories. © 1990.
引用
收藏
页码:237 / 248
页数:12
相关论文
共 25 条
[1]   EXPLICIT CONSTRUCTION OF EXPONENTIAL SIZED FAMILIES OF K-INDEPENDENT SETS [J].
ALON, N .
DISCRETE MATHEMATICS, 1986, 58 (02) :191-193
[2]  
BEVERAGGI M, 1988, LECT NOTES COMPUT SC, V311, P39
[3]  
BUSSCHBACH P, 1984, ENST84D005 RAPP INT
[4]   CODING FOR WRITE-UNIDIRECTIONAL MEMORIES AND CONFLICT-RESOLUTION [J].
COHEN, G ;
SIMONYI, G .
DISCRETE APPLIED MATHEMATICS, 1989, 24 (1-3) :103-114
[5]  
COHEN GD, 1984, TRAITEMENT SIGNAL, V1
[6]  
COHEN GD, 1983, IEEE T INFORM THEORY, V29, P354
[7]  
DEZA ME, 1965, PROBL PEREDACHI INF, V1, P29
[8]   FAMILIES OF FINITE SETS IN WHICH NO SET IS COVERED BY THE UNION OF 2 OTHERS [J].
ERDOS, P ;
FRANKL, P ;
FUREDI, Z .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (02) :158-166
[9]  
FELLOWS MR, 1986, CS86144 WASH STAT U
[10]  
Frankl P., 1984, EUROP J COMBINATORIC, V5, P127