论文信息 - On the weight hierarchy of the semiprimitive codes

On the weight hierarchy of the semiprimitive codes

Abstract An irreducible cyclic ( n, k ) code is said to be semiprimitive if n = (2 k − 1)/ N where N > 2 divides 2 j + 1 for some j ⩾ 1. The complete weight hierarchy of the semiprimitive codes is determined when k /2 j is odd. In the other cases, when k /2 j is even, some partial results on the generalized Hamming weights of the semiprimitive codes are obtained. We apply the above results to find the generalized Hamming weight of some classes of dual codes of primitive BCH codes with designed distance N + 2 when k /2 j is odd.

Tor Helleseth | P. Vijay Kumar

[1] M. van der Vlugt,et al. The Second Generalized Hamming Weight of the Dual Codes of Double-Error Correcting Binary BCH-Codes , 1995 .

[2] Marcel van der Vlugt,et al. On generalized Hamming weights of BCH codes , 1994, IEEE Trans. Inf. Theory.

[3] Marcel van der Vlugt,et al. Fibre Products of Artin-Schreier Curves and Generalized Hamming Weights of Codes , 1995, J. Comb. Theory, Ser. A.

[4] Marcel van der Vlugt. On the Weight Hierarchy of Irreducible Cyclic Codes , 1995, J. Comb. Theory, Ser. A.

[5] Robert J. McEliece,et al. Weights of Irreducible Cyclic Codes , 1972, Inf. Control..

[6] Henning Stichtenoth,et al. Generalized Hamming weights for duals of BCH codes, and maximal algebraic function fields , 1996 .

[7] L. Carlitz,et al. Bounds for exponential sums , 1957 .

[8] ShimChangshik,et al. On the second generalized Hamming weight of the dual code of a double-error-correcting binary BCH code , 1995 .

[9] Tor Helleseth,et al. Generalized Hamming weights of linear codes , 1992, IEEE Trans. Inf. Theory.

[10] Tor Helleseth,et al. The weight hierarchy of the Kasami codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[11] V. K. Wei,et al. On The Generalized Hamming Weights Of Several Classes Of Cyclic Codes , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.