An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes.
Ken-ichi IwataHirosuke YamamotoPublished in: ITW (2020)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- binary trees
- globally optimal
- preprocessing
- learning algorithm
- detection algorithm
- tree structure
- experimental evaluation
- optimization algorithm
- times faster
- computational complexity
- error correcting codes
- computational cost
- matching algorithm
- cost function
- exhaustive search
- closed form
- recognition algorithm
- expectation maximization
- error correcting
- np hard
- significant improvement
- k means
- compact representations
- tree representation
- logical operations
- particle swarm optimization
- space complexity
- convergence rate
- high accuracy
- evolutionary algorithm
- data structure
- objective function
- reinforcement learning
- decision trees