Bounds for Codes in the Case of Finite-Volume List Decoding

The author obtains asymptotic upper and lower bounds for the cardinality of a binary code that is decoded by a list of fixed volume, for the case in which the average radius or radius of the decoding sphere of the code is specified. The resultant bounds are asymptotically exact in the case of zero rate.