On generalized Hamming weights for Galois ring linear codes
From MaRDI portal
Publication:1389147
DOI10.1023/A:1008227811117zbMATH Open0956.94014MaRDI QIDQ1389147FDOQ1389147
Authors: Alexei Ashikhmin
Publication date: 18 March 2001
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Recommendations
lower boundgeneralized Hamming weightsKerdock codeGalois ring linear codesupper and existence bounds
Cited In (12)
- On linear codes over \(\mathbb Z_2\)
- On the Hamming distance of linear codes over a finite chain ring
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Relative generalized Hamming weights over Frobenius rings
- Hamming metric decoding of alternant codes over Galois rings
- On the dual of quaternary Goethals codes and their weight hierarchies
- Further results on higher weights of codes over finite rings
- Wei-type duality theorems for rank metric codes
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- Computing generalized hamming weights of binary linear codes via free resolutions
- Support weight distribution of \(\mathbb Z_4\)-linear codes
- Wei-type duality theorems for matroids
This page was built for publication: On generalized Hamming weights for Galois ring linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389147)