New upper bounds on generalized weights

IEEE Transactions on Information Theory

Volumn 45, Issue 4, 1999, Pages 1258-1263

  Ashikhmin, Alexei ^a   Barg, Alexander ^a   Litsyn, Simon ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); LINEAR PROGRAMMING; SET THEORY; THEOREM PROVING;

CONSTANT-WEIGHT CODES; GENERALIZED WEIGHTS;

BINARY CODES;

EID: 0032629435     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761280     Document Type: Article

References (19)

1. A. Ashikhmin On generalized Hamming weights for Galois ring linear codes," Des., Codes Cryptogr., vol. 14, pp. 107-126, 1998.
2. A. Ashikhmin and A. Barg Binomial moments of the distance distribution: Bounds and applications," IEEE Trans. Inform. Theory, vol. 45, pp. 438-452, Mar. 1999.
3. A. Barg The matroid of supports of a linear code," Appl. Alg. Engrg. Commun. Comput., vol. 8, no. 2, pp. 165-172, 1997.
4. L. A. Bassalygo Supports of a code," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, G. Cohen, M. Giustu, and T. Mora, Eds. (AAECC-11), Lecture Notes in Computer Science, vol. 948. Berlin, Germany: Springer-Verlag, 1995, pp. 1-3.
5. G. Cohen, L. Huguet, and G. Zémor Bounds on generalized weights," in Algebraic Coding. Proc. 1st French-Israeli Workshop, G. Cohen et al., Eds.. Lecture Notes in Computer Science, vol. 781. Berlin, Germany: Springer-Verlag, 1994, pp. 270-277.
6. G. Cohen, S. Litsyn, and G. Zémor Upper bounds on generalized distances," IEEE Trans. Inform. Theory, vol. 40, pp. 2090-2092, 1994.
7. G. Cohen and G. Zémor Intersecting codes and independent families," IEEE Trans. Inform. Theory, vol. 40, pp. 1872-1881, Nov. 1994.
8. T. Helleseth, T. Klove, V. I. Levenshtein, and O. Ytrehus Bounds on the minimum support weights," IEEE Trans. Inform. Theory, vol. 41, pp. 432-440, Mar. 1995.
9. 1 -1)/JV)," Discr. Math., vol. 18, pp. 179-211, 1977.
10. G. Kabatianski On second generalized Hamming weight," in Proc. Int. Workshop on Algebraic and Combinatorial Coding Theory (Voneshta Voda, Bulgaria, June 22-28, 1992), pp. 98-100.
11. 1) having generator matrices over GF(
12. V. I. Levenshtein Upper-bound estimates for fixed-weight codes," Probl. Pered. Inform., vol. 7, no. 4, pp. 3-12, 1971, in Russian. English translation in Probl. Inform. Transm., vol. 7, pp. 281-287, 1971.
13. S. Litsyn New upper bounds on error exponents," IEEE Trans. Inform. Theory, vol. 45, pp. 385-398, Mar. 1999.
14. R. J. McEliece, E. R. Rodemich, H. Rumsey, and L. R. Welch New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT23, pp. 157-166, Mar. 1977.
15. A. Samorodnitsky On the optimum of Delsarte's linear program," J. Comb. Theory, Ser. A, to be published.
16. J. Simonis The effective length of subcodes," Appl. Alg. Eng. Commun. Comput., vol. 5, pp. 371-377, 1994.
17. M. A. Tsfasman and S. G. Vlâdu} Geometric approach to higher weights," IEEE Trans. Inform. Theory, vol. 41, pp. 1564-1588, 1995.
18. S. G. Vlâdu; An upper bound for generalized Hamming weights," in Arithmetic, Geometry and Coding Theory, R. Pellikaan and S. G. Vlâdu;, Eds. (Luminy, France, 1993). Berlin, Germany: de Gruyter, 1996, pp. 263-267.
19. V. Wei Generalized Hamming weights for linear codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, Sept. 1991.