Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural

DOI10.1080/00207160212113zbMath1005.94015OpenAlexW1980424044MaRDI QIDQ4551539

Liang Zhang, Wei-Jia Jia, Dong Yang Long

Publication date: 11 February 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160212113

zbMATH Keywords

variable-length codessynchronous codessemaphore codesmaximal prefix codeproduct of languagesmaximal biprefix codesmaximal infix codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• On group codes
• An answer to a question about finite maximal prefix sets of words
• Languages whose \(n\)-element subsets are codes
• Outfix and infix codes and related classes of languages
• On the structure of some group codes

This page was built for publication: Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural