Determination of the asymptotic largest minimum distance of block codes

We present a general formula for the asymptotic largest minimum distance (in blocklength) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric and bounded). An alternative expression for the same formula, which is useful in characterizing the general Varshamov-Gilbert bound, is next addressed.