Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes.
Mohammadali KhosravifardShima KheradmandPublished in: IEEE Trans. Inf. Theory (2012)
Keyphrases
- upper bound
- worst case
- lower bound
- tight bounds
- efficiently computable
- minimum distance
- error correcting codes
- error correction
- closed form expressions
- optimal cost
- lower and upper bounds
- optimal solution
- special case
- upper and lower bounds
- branch and bound
- closed form
- expected cost
- joint optimization
- error correcting
- constant factor
- sample complexity
- dynamic programming