Classification of Griesmer codes and dual transform
From MaRDI portal
Publication:1043574
DOI10.1016/j.disc.2008.12.002zbMath1204.94098MaRDI QIDQ1043574
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.002
Related Items
New upper bounds and constructions of multi-erasure locally recoverable codes, New code equivalence based on relative generalized Hamming weights, On relative constant-weight codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear codes which attain the Solomon-Stiffler bound
- Minimum possible block length of a linear binary code for some distances
- Projective two-weight codes with small parameters and their corresponding graphs
- Minimum block length of a linear q-ary code with specified dimension and code distance
- Codes and projective multisets
- Caps and codes
- Divisibility of codes meeting the Griesmer bound
- The correspondence between projective codes and 2-weight codes
- Some new results on optimal codes over \(\mathbb F_5\)
- Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
- Weights of linear codes and strongly regular normed spaces
- Rainbow cliques and the classification of small BLT-sets
- Further classifications of codes meeting the Griesmer bound (Corresp.)
- The Geometry of Two-Weight Codes
- On the inherent intractability of certain coding problems (Corresp.)
- Isomorph-Free Exhaustive Generation
- On the [162,8,80 codes]
- Some new results for optimal ternary linear codes
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- A note on the Griesmer bound (Corresp.)
