Author： Nguyen H.L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.182, Iss.1, 1997-08, pp. : 245-256
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
An application of Hajos factorizations to variable-length codes
By De Felice C.
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Access to resources
Recommend
Completion of recognizable bifix codes
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Completion of codes with finite bi-decoding delays
By Zhang L. Shum K.P. Peng S.-L.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Generalized factorizations of words and their algorithmic properties
By Karhumaki J. Plandowski W. Rytter W.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :