This is the authors' abstract. We don't add key points for this paper.
We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ashikhmin et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: