Answers are grounded in this paper and cite their sources.
We derive new asymptotic bounds for generalized distances. Our approach extends the classical Hamming, Plotkin, and Elias bounds. The latter bound involves extending the definition of generalized distances to nonlinear codes.>
No takes yet. Share an insight, caveat, or question.
Cohen et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: