An embedding algorithm for supercodes and sucypercodes

MaRDI QIDQ882673zbMATH OpenFDO

Authors Kieu Van Hung, Nguyen Quy Khang

Publication date 24 May 2007

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

embedding problemhypercodeprefix codesucypercodesupercode

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Review text

Supercodes and sucypercodes [Acta Math. Vietnam. 29, No. 2, 163--176 (2004; Zbl 1071.94007), Acta Math. Vietnam. 31, No. 1, 17--30 (2006; Zbl 1095.94018)], [\textit{M. Ito}, (ed.); \textit{T. Imaoka}, (ed.) Words, languages and combinatorics. Proceedings of the international conference, Kyoto, March 14--18, 2000. River Edge, NJ: World Scientific (2003; Zbl 1099.68645)] form classes of prefix codes for which the existence of the maximal ones have been proved. The paper presents a new algorithm that for a given supercode \(X\) (or sucypercode) constructs the maximal supercode (or sucypercode) \(Y\) containing \(X\).

Recommendations

• On maximality for some kinds of codes over two-letter alphabets
• On codes defined by binary relations. II: Characterizations and maximality
• On codes defined by binary relations. I: Embedding problem
• On alphabetic coding for superwords
• On maximal synchronous codes.

Cited in

(2)

• On maximality for some kinds of codes over two-letter alphabets
• On codes defined by binary relations. II: Characterizations and maximality

This page was built for publication: An embedding algorithm for supercodes and sucypercodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q882673)