On Generalized Hamming Weights for Galois Ring Linear Codes
Designs, Codes and Cryptography
Two New Infinite Families of 3-Designs from Kerdock Codesover \mbox{ Z } _4
Designs, Codes and Cryptography
Two Generalized Constructions of Relative Difference Sets
Journal of Algebraic Combinatorics: An International Journal
On Generalized Hamming Weights for Codes over Finite Chain Rings
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Assmus–Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4
Designs, Codes and Cryptography
On Linear Codes over$${\mathbb{Z}}_{2^{s}}$$
Designs, Codes and Cryptography
A Ring Theoretic Construction of Hadamard Difference Sets in ℤ8n×ℤ2n
Journal of Algebraic Combinatorics: An International Journal
Two New Families of Low-Correlation Interleaved QAM Sequences
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
| Hi-index | 754.84 |
The rth generalized Hamming weight dr of the Kerdock code of length 2m over Z4 is considered. A lower bound on dr is derived for any r, and dr is exactly determined for r=0.5, 1, 1.5, 2, 2.5. In the case of length 2 2m, dr is determined for any r, where 0⩽r⩽m and 2r is an integer. In addition, it is shown that it is sometimes possible to determine the generalized Hamming weights of the Kerdock codes of larger length using the results of dr for a given length. The authors also provide a closed-form expression for the Lee weight of a Kerdock codeword in terms of the coefficients in its trace expansion