MAXIMAL PREFIX-SYNCHRONIZED CODES

被引:60
作者
GUIBAS, LJ [1 ]
ODLYZKO, AM [1 ]
机构
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
关键词
D O I
10.1137/0135034
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:401 / 418
页数:18
相关论文
共 11 条
[1]   ON THE CONSTRUCTION OF COMMA-FREE CODES [J].
EASTMAN, WL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (02) :263-267
[2]  
Feller, 1968, INTRO PROBABILITY TH
[3]  
GARDNER M, 1974, SCI AM, V231, P120
[4]   SYNCHRONIZATION OF BINARY MESSAGES [J].
GILBERT, EN .
IRE TRANSACTIONS ON INFORMATION THEORY, 1960, 6 (04) :470-477
[5]  
GOLOMB S. W., 1958, BIOL MEDDEL DANSKE VIDENSKAB SELSKAB, V23, P1
[6]  
Golomb S.W., 1958, CAN J MATH, V10, P202
[7]  
GUIBAS L, UNPUBLISHED
[8]   RECENT RESULTS IN COMMA-FREE CODES [J].
JIGGS, BH .
CANADIAN JOURNAL OF MATHEMATICS, 1963, 15 (01) :178-&
[9]  
Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024
[10]   BIFIX-FREE SEQUENCES [J].
NIELSEN, PT .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (05) :704-706