Bounds and constructions of codes over symbol-pair read channels

Ohad Elishco, Ryan Gabrys, Eitan Yaakobi

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


Cassuto and Blaum recently studied the symbol-pair channel, a model where every two consecutive symbols are read together. This special channel structure is motivated by the limitations of the reading process in high density data storage systems, where it is no longer possible to read individual symbols. In this new paradigm, the errors are not individual symbol errors, but rather symbol-pair errors, where at least one of the symbols is erroneous. In this work, we study bounds and constructions of codes over the symbol-pair channel. We extend the Johnson bound and the linear programming bound for this channel and show that they improve upon existing bounds. We then propose new code constructions that improve upon existing results for pair-distance six, seven, and ten.

Original languageEnglish
Article number8844116
Pages (from-to)1385-1395
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number3
StatePublished - 1 Mar 2020
Externally publishedYes


  • Coding theory
  • codes for storage media
  • symbol-pair codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Bounds and constructions of codes over symbol-pair read channels'. Together they form a unique fingerprint.

Cite this