Bounds and Constructions of Codes Over Symbol-Pair Read Channels
- 18 September 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (3) , 1385-1395
Abstract
Cassuto and Blaum recently studied the symbolpair 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.Keywords
Funding Information
- Israel Science Foundation (1624/14)
- NISE Program at the Naval Information Warefare Center
This publication has 19 references indexed in Scilit:
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codesDesigns, Codes and Cryptography, 2016
- Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read ChannelsIEEE Transactions on Information Theory, 2016
- Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read ChannelIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016
- Algebraic Decoding of BCH Codes over Symbol-Pair Read Channels: Cases of Two-Pair and Three-Pair Error CorrectionIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016
- A Construction of New MDS Symbol-Pair CodesIEEE Transactions on Information Theory, 2015
- A Decoding Algorithm for Cyclic Codes over Symbol-Pair Read ChannelsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015
- Syndrome decoding of symbol-pair codes2014
- Symbol-pair codes: Algebraic constructions and asymptotic bounds2011
- On the Design of Codes for DNA Computing2006
- On the existence of optimum cyclic burst- correcting codesIEEE Transactions on Information Theory, 1986