On generalized hamming weights and the covering radius of linear codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
| Hi-index | 754.84 |
We prove several results on the generalized Hamming weights (GHW's) of linear codes, particularly for cyclic codes. Based on these and previously known results, we give some efficient algorithms for computing GHW hierarchy of cyclic codes. We give complete weight hierarchy for each of the binary cyclic codes of odd lengths ⩽31. A table of second and third GHW's of binary cyclic codes of odd lengths ⩽57 is also presented. We have also computed the second GHW of all binary cyclic codes of length 63 and the third GHW of one code from each dimension