Completing comma-free codes

被引：0
|
作者：
Lam, NH [1 ]
机构：
[1] Hanoi Inst Math, Hanoi 10000, Vietnam
来源：
THEORETICAL COMPUTER SCIENCE | 2003年 / 301卷 / 1-3期
关键词：
comma-free codes; completion; regular maximal comma-free codes;
D O I：
10.1016/S0304-3975(02)00595-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal. (C) 2002 Published by Elsevier Science B.V.
引用
收藏
页码：399 / 415
页数：17
相关论文
共 50 条
12345