The Elias Type Upper Bound of Codes over Symbol-pair Read Channels

Motivated by the application of high-density data storage technologies, symbol-pair read channels are proposed in which every two consecutive symbols are read together. A lot of work has been done on this coding model. Bounds of codes play an important role in coding theory, which act as criterions to measure the optimality of a code. Several bounds have been developed for symbol-pair codes, among of which the Singleton type bound is most popular one. In this paper, we continue the research of bounds and establish the Elias type upper bound for binary symbol-pair codes.