MathDB5 problems
- 0 votes0 replies1 view
Worst-case redundancy conjecture under alphabet-size conditions for binary AIFV- codes
Conditional binary AIFV- redundancy conjecture. Under certain conditions on the size of the source alphabet, the worst-case redundancy of optimal binary AIFV- codes is
- 0 votes0 replies0 views
Upper-bound conjecture for the redundancy of binary AIFV- codes
Binary AIFV- upper-bound conjecture. For every source, the redundancy of an optimal binary AIFV- code is at most
- 0 votes0 replies0 views
Worst-case redundancy conjecture for binary AIFV- codes
Binary AIFV- redundancy conjecture. For every natural number , the worst-case redundancy of optimal binary AIFV- codes is
- 0 votes0 replies1 view
Worst-case redundancy conjecture for extended binary AIFV codes
Extended AIFV redundancy conjecture. When the alphabet is sufficiently large relative to , the worst-case redundancy of optimal extended binary AIFV codes is
- 0 votes0 replies0 views
Yamamoto's multi-tree conjecture for binary AIFV codes
Yamamoto's conjecture. Binary AIFV codes might attain better compression performance when more code trees are allowed to be used.