Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Additive codes attaining the Griesmer bound
Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.