TY - JOUR
T1 - Bounds and constructions of codes over symbol-pair read channels
AU - Elishco, Ohad
AU - Gabrys, Ryan
AU - Yaakobi, Eitan
N1 - Funding Information:
Manuscript received August 24, 2018; revised August 13, 2019; accepted September 7, 2019. Date of publication September 18, 2019; date of current version February 14, 2020. This work was supported in part by the Israel Science Foundation under grant 1624/14 and by the NISE Program at the Naval Information Warefare Center. This paper was presented in part at the 2018 IEEE International Symposium on Information Theory (ISIT) [7].
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2020/3/1
Y1 - 2020/3/1
N2 - 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.
AB - 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.
KW - Coding theory
KW - codes for storage media
KW - symbol-pair codes
UR - http://www.scopus.com/inward/record.url?scp=85081053228&partnerID=8YFLogxK
U2 - 10.1109/TIT.2019.2942283
DO - 10.1109/TIT.2019.2942283
M3 - Article
AN - SCOPUS:85081053228
VL - 66
SP - 1385
EP - 1395
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 3
M1 - 8844116
ER -