For sufficiently large minimum distances, the minimal length of linear b-symbol codes equals the Griesmer-type bound, and exact values are found for binary pair-symbol codes of dimensions 3, 4, and 5.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear codes for $b$-symbol read channels attaining the Griesmer bound
For sufficiently large minimum distances, the minimal length of linear b-symbol codes equals the Griesmer-type bound, and exact values are found for binary pair-symbol codes of dimensions 3, 4, and 5.