Completing biprefix codes (Q790624)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completing biprefix codes |
scientific article; zbMATH DE number 3848631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completing biprefix codes |
scientific article; zbMATH DE number 3848631 |
Statements
Completing biprefix codes (English)
0 references
1984
0 references
This short and well-written paper shows that each finite biprefix code can be extended to a recognizable maximal biprefix code. To obtain this result the author proves some other interesting facts for biprefix codes in terms of formal power series.
0 references
biprefix codes
0 references
formal power series
0 references
0.827208399772644
0 references
0.8210406303405762
0 references
0.8185608386993408
0 references
0.8185608386993408
0 references
