Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric
- 5 July 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 7840-7847
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.Keywords
All Related Versions
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:
- The b-symbol weight distributions of all semiprimitive irreducible cyclic codesDesigns, Codes and Cryptography, 2023
- Complete b-symbol weight distribution of some irreducible cyclic codesDesigns, Codes and Cryptography, 2022
- Bounds and Constructions of Codes Over Symbol-Pair Read ChannelsIEEE Transactions on Information Theory, 2019
- Maximum distance separable codes for b-symbol read channelsFinite Fields and Their Applications, 2018
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal ConstructionsIEEE Transactions on Information Theory, 2017
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power LengthsIEEE Transactions on Information Theory, 2017
- Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read ChannelsIEEE Transactions on Information Theory, 2016
- A Construction of New MDS Symbol-Pair CodesIEEE Transactions on Information Theory, 2015
- Maximum Distance Separable Codes for Symbol-Pair Read ChannelsIEEE Transactions on Information Theory, 2013
- Codes for Symbol-Pair Read ChannelsIEEE Transactions on Information Theory, 2011