CODING FOR WRITE-UNIDIRECTIONAL MEMORIES AND CONFLICT-RESOLUTION

被引:5
作者
COHEN, G
SIMONYI, G
机构
关键词
D O I
10.1016/0166-218X(92)90276-G
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:103 / 114
页数:12
相关论文
共 17 条
[1]  
BORDEN JM, IN PRESS IEEE T INFO
[2]  
BUSSCHBACH P, 1984, ENST84 D005 RAPP INT
[3]  
COHEN G, 1986, IEEE T INFORM THEORY, V32, P687
[4]   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
[5]  
Frankl P., 1984, EUROP J COMBINATORIC, V5, P127
[6]   ON THE CAPACITY OF COMPUTER MEMORY WITH DEFECTS [J].
HEEGARD, C ;
ELGAMAL, AA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) :731-739
[7]  
KATONA GOH, 1974, MATH CTR TRACTS, V56, P13
[8]  
Kleitman D. J., 1973, Discrete Mathematics, V6, P255, DOI 10.1016/0012-365X(73)90098-8
[9]   AN ASYMPTOTICALLY NONADAPTIVE ALGORITHM FOR CONFLICT-RESOLUTION IN MULTIPLE-ACCESS CHANNELS [J].
KOMLOS, J ;
GREENBERG, AG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (02) :302-306
[10]  
Macwilliams F., 1986, THEORY ERROR CORRECT