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

Title data

Kurz, Sascha:
Linear codes for b-symbol read channels attaining the Griesmer bound.
Bayreuth , 2025 . - 27 p.
DOI: https://doi.org/10.15495/EPub_UBT_00008523

Official URL:

Abstract in another language

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.

Further data

Item Type:	Preprint, postprint
Keywords:	pair-symbol codes; b-symbol metric; optimal linear codes; Griesmer bound
Institutions of the University:	Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science
Result of work at the UBT:	Yes
DDC Subjects:	000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics
Date Deposited:	19 Jul 2025 21:00
Last Modified:	21 Jul 2025 05:45
URI:	https://eref.uni-bayreuth.de/id/eprint/94233