Optimal codes and arcs for the generalized Hamming weights
Abstract
This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is sufficiently large. We also determine the parameters of optimal binary codes for dimensions at most seven and the optimal ternary codes for dimensions at most five.
Fields of Study & Subjects
Coding theory and cryptography
graph theory and CDMA systems
Finite Group Theory Research
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 1 January 2026
- Document type
- Preprint