A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes.
Mordecai J. GolinElfarouk HarbPublished in: IEEE Trans. Inf. Theory (2023)
Keyphrases
- worst case
- optimal solution
- computational complexity
- dynamic programming
- objective function
- preprocessing
- learning algorithm
- globally optimal
- computational cost
- experimental evaluation
- np hard
- k means
- binary tree
- significant improvement
- closed form
- matching algorithm
- detection algorithm
- locally optimal
- non binary
- exhaustive search
- optimization algorithm
- expectation maximization
- multi class
- special case
- np complete
- simulated annealing
- approximation algorithms
- space complexity
- probabilistic model
- cost function
- search space