New improved lower bounds for the sizes of error correcting codes for list decoding are derived, both for linear and nonlinear codes. For small lists it is shown that this lower bound equals Elias’ upper bound. It remains an open question if this is true in general.
G.Dueck (Heidelberg)