Generalizations of the Griesmer bound
From MaRDI portal
Publication:4637802
DOI10.1007/3-540-58265-7_6zbMath1384.94139OpenAlexW1531572787MaRDI QIDQ4637802
Øyvind Ytrehus, Torleiv Kløve, Tor Helleseth
Publication date: 26 April 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58265-7_6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
- Support weight distribution of linear codes
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- The effective length of subcodes
- Generalized Hamming weights of codes on multi-dimensional quadrics
- The weight hierarchy of the Kasami codes
- On the weight hierarchy of the semiprimitive codes
- Generalized Hamming weights for linear codes
- On the generalized Hamming weights of several classes of cyclic cods
- Generalized Hamming weights of linear codes
- Minimum support weights of binary codes
- Codes satisfying the chain condition
- The weight hierarchy of higher dimensional Hermitian codes
- On generalized Hamming weights of BCH codes
- Generalized Hamming weights of trace codes
- Generalized Hamming Weights of Melas Codes and Dual Melas Codes
- The Second Generalized Hamming Weight of the Dual Codes of Double-Error Correcting Binary BCH-Codes
- On the weight hierarchy of geometric Goppa codes
- Bounds on the minimum support weights
- Dimension/length profiles and trellis complexity of linear block codes
- Upper bounds on generalized distances
- A Bound for Error-Correcting Codes
This page was built for publication: Generalizations of the Griesmer bound
