Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes | IEEE Journals & Magazine | IEEE Xplore