Abstract
The b-symbol metric is a generalization of the Hamming metric. Linear codes in the b-symbol metric have been used in the read channel whose outputs consist of b consecutive symbols. The Griesmer bound outperforms the Singleton bound for ${\mathbb {F}}_{q}$ -linear codes in the Hamming metric, when q is fixed and the length is large enough. This scenario is also applicable in the b-symbol metric. Shi, Zhu, and Helleseth recently made a conjecture on cyclic codes in the b-symbol metric. In this paper, we present the b-symbol Griesmer bound for linear codes by concatenating linear codes and simplex codes. Based on cyclic codes and extended cyclic codes, we propose two families of distance-optimal linear codes with respect to the b-symbol Griesmer bound.
Funding Information
  • The work of Gaojun Luo was supported
  • Nanyang Technological University (04INS000047C230GRT01)
  • Natural Science Foundation of Jiangsu Province (BK20230867)
  • Nanjing University of Aeronautics and Astronautics (NS2024045)
  • Post-Doctoral Fellowship Program of China Postdoctoral Science Foundation (GZC20242234)
  • Nanyang Technological University Research (04INS000047C230GRT01)

This publication has 17 references indexed in Scilit: