On Linear Perfect b-Symbol Codes over Finite Fields

Kanat Abdukhalikov, Jiajie Chen, Rongquan Feng

Research output: Contribution to journalArticlepeer-review


Motivated by the application of high-density data storage technologies, Cassuto and Blaum introduced codes for symbol-pair read channels in 2011, and Yaakobi et al. generalized the coding framework to that for b-symbol read channels where (Formula presented.) in 2016. In this paper, we establish a b-sphere-packing bound and present a recurrence relationship for the b-weight enumerator. We determine all parameters of linear perfect b-symbol e-error-correcting codes over (Formula presented.) for (Formula presented.) and show that for (Formula presented.), there exist at most finite such codes for a given (Formula presented.) and q. We construct a family of linear perfect b-symbol b-error-correcting codes over (Formula presented.) using constacyclic codes.

Original languageEnglish
Article number4128
Issue number19
Publication statusPublished - Oct 2023


  • b-distance
  • b-sphere-packing bound
  • b-symbol code
  • b-weight
  • perfect b-symbol code

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • General Mathematics
  • Engineering (miscellaneous)


Dive into the research topics of 'On Linear Perfect b-Symbol Codes over Finite Fields'. Together they form a unique fingerprint.

Cite this