A polynomial time algorithm for constructing optimal binary AIFV-2 codes (Q6574963)
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: A polynomial time algorithm for constructing optimal binary AIFV-2 codes |
scientific article; zbMATH DE number 7883502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for constructing optimal binary AIFV-2 codes |
scientific article; zbMATH DE number 7883502 |
Statements
A polynomial time algorithm for constructing optimal binary AIFV-2 codes (English)
0 references
19 July 2024
0 references
geometric interpretation
0 references
space of binary AIFV-2 codes
0 references
almost optimal instantaneous fixed-to-variable (AIFV) codes
0 references
polynomially time-bounded procedure
0 references
construction of optimal AIFV codes
0 references
binary-search like procedure
0 references
