New Upper Bounds on Generalized Weights

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.

[1]  Torleiv Kløve.  The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>) , 1978, Discret. Math..

[2]  S. G. Vlăduţ.  An upper bound for generalized Hamming weights , 1996 .

[3]  Torleiv Kløve,et al.  The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N) , 1977, Discret. Math..

[4]  Gérard D. Cohen,et al.  Intersecting codes and independent families , 1994, IEEE Trans. Inf. Theory.

[5]  Alexei E. Ashikhmin.  On Generalized Hamming Weights for Galois Ring Linear Codes , 1998, Des. Codes Cryptogr..

[6]  Gérard D. Cohen,et al.  Bounds on generalized weights , 1993, Algebraic Coding.

[7]  Gérard D. Cohen,et al.  Upper bounds on generalized distances , 1994, IEEE Trans. Inf. Theory.

[8]  Simon Litsyn,et al.  New Upper Bounds on Error Exponents , 1999, IEEE Trans. Inf. Theory.

[9]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[10]  Michael A. Tsfasman,et al.  Geometric approach to higher weights , 1995, IEEE Trans. Inf. Theory.

[11]  Alexander Barg,et al.  The Matroid of Supports of A Linear Code , 1997, Applicable Algebra in Engineering, Communication and Computing.

[12]  Alex Samorodnitsky,et al.  On the Optimum of Delsarte's Linear Program , 2001, J. Comb. Theory, Ser. A.

[13]  Tor Helleseth,et al.  Bounds on the minimum support weights , 1995, IEEE Trans. Inf. Theory.

[14]  Leonid A. Bassalygo.  Supports of a Code , 1995, AAECC.

[15]  Alexander Barg,et al.  Binomial Moments of the Distance Distribution: Bounds and Applications , 1999, IEEE Trans. Inf. Theory.

[16]  I. G. Núñez,et al.  Generalized Hamming Weights for Linear Codes , 2001 .