The authors derive five iterative lower bounds on error coefficients of Griesmer-optimal linear codes, prove tightness for most binary cases up to dimension 5, and determine all 5-dimensional AFER-optimal binary codes.
Binary codes with specified minimum distance,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
The authors derive five iterative lower bounds on error coefficients of Griesmer-optimal linear codes, prove tightness for most binary cases up to dimension 5, and determine all 5-dimensional AFER-optimal binary codes.