DIMACS TR: 98-53

New Upper Bounds on Generalized Weights

Authors: A.Ashikhmin, A. Barg and S. Litsyn


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.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1998/98-53.ps.gz
DIMACS Home Page