Completing biprefix codes (Q790624)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completing biprefix codes |
scientific article |
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
