An embedding algorithm for supercodes and sucypercodes (Q882673)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5156813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An embedding algorithm for supercodes and sucypercodes |
scientific article; zbMATH DE number 5156813 |
Statements
An embedding algorithm for supercodes and sucypercodes (English)
0 references
24 May 2007
0 references
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\).
0 references
prefix code
0 references
hypercode
0 references
supercode
0 references
sucypercode
0 references
embedding problem
0 references
0.8323655724525452
0 references
0.8254106044769287
0 references
0.7424023747444153
0 references
0.7357157468795776
0 references
0.7288669347763062
0 references
