Linear codes for $b$-symbol read channels attaining the Griesmer bound

TL;DR

This paper investigates the optimal parameters of linear codes in the $b$-symbol read channel, achieving bounds like the Griesmer bound, with specific results for the pair-symbol case in binary codes.

Contribution

It determines the optimal parameters of linear codes in the $b$-symbol metric, including the Griesmer bound attainment and specific results for binary codes with small dimensions.

Findings

Optimal code parameters for large minimum distance in $b$-symbol metric.

Linear binary codes in the pair-symbol metric with small dimensions are characterized.

Codes attain the Griesmer bound under certain conditions.

Abstract

Reading channels where $b$-tuples of adjacent symbols are read at every step have e.g.\ applications in storage. Corresponding bounds and constructions of codes for the $b$-symbol metric, especially the pair-symbol metric where $b=2$, were intensively studied in the last fifteen years. Here we determine the optimal code parameters of linear codes in the $b$-symbol metric assuming that the minimum distance is sufficiently large. We also determine the optimal parameters of linear binary codes in the pair-symbol metric for small dimensions.