On Lower Bounds for the Redundancy of Optimal Codes