On Generalized Hamming Weights for Galois Ring Linear Codes

Authors:
Alexei Ashikhmin
Affiliations:
Los Alamos National Laboratory Group CIC-3, MS P990, Los Alamos, NM 87545
Venue:
Designs, Codes and Cryptography
Year:
1998

Citing 3
Cited 6

Supports of a Code

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the weight hierarchy of Kerdock codes over Z4

IEEE Transactions on Information Theory
Upper bounds on generalized distances

IEEE Transactions on Information Theory

Support weight distribution of Z4-linear codes

Discrete Mathematics
On Z4-Simplex Codes and Their Gray Images

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
A Griesmer bound for linear codes over finite quasi-Frobenius rings

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
On Linear Codes over$${\mathbb{Z}}_{2^{s}}$$

Designs, Codes and Cryptography
Wei-type duality theorems for matroids

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

The definition of generalized Hamming weights (GHW)for linear codes over Galois rings is discussed. The propertiesof GHW for Galois ring linear codes are stated. Upper and existencebounds for GHW of ZF_4– linear codes and a lowerbound for GHW of the Kerdock code over Z_4–are derived. GHW of some ZF_4– linear codes aredetermined.