|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc040104,
author = {Liang Zhang and Kar-Ping Shum and Shou-Li Peng},
title = {Generalized Prefix Relations and Codes with
Finite Decoding Delay},
journal = jalc,
year = 1999,
volume = 4,
number = 1,
pages = {59--71},
keywords = {generalized prefix relations, $G$-prefix kernels,
$G$-prefix roots, codes with finite decoding delay,
rational codes, thin codes, complete codes},
abstract = {In this paper, we propose a generalized prefix relation
which is called the generalized $G$-prefix relation for a
language $G$. We show that a code $X$ with decoding delay
$d$ is a $(X^dA^{*})(X^dA^{*})^{-1}$-prefix set. Based on
this idea, the construction of embedding a prefix code into
a complete one can be extended to the construction of
embedding a code with decoding delay $d$ into a complete one.}
}