Login / Signup
Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes.
Mohammad Javad-Kalbasi
Mohammadali Khosravifard
Published in:
IEEE Trans. Inf. Theory (2020)
Keyphrases
</>
lower bound
upper bound
worst case
optimal cost
lower and upper bounds
data structure
branch and bound
objective function
data sets
neural network
optimal solution
search algorithm
dynamic programming
linear programming
closed form