Tight upper bounds on the redundancy of optimal binary AIFV codes.
Weihua HuHirosuke YamamotoJunya HondaPublished in: ISIT (2016)
Keyphrases
- upper bound
- worst case
- lower bound
- tight bounds
- efficiently computable
- optimal cost
- upper and lower bounds
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- branch and bound
- constant factor
- closed form expressions
- dynamic programming
- np hard
- neural network
- logical operations
- provide an upper bound
- average case
- error correction
- linear programming
- active learning
- objective function
- learning algorithm