Abstract
In this paper, we develop a new decoding algorithm of binary linear codes for symbol-pair read channel. The Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channel whose write resolution is higher than read resolution. The proposed decoding algorithm is based on the linear programming (LP). It is proved that the proposed LP decoder has the maximum-likelihood (ML) certificate property, i.e., the output of the decoder is guaranteed to be the ML codeword when it is integral. We also introduce the fractional pair distance dfp of the code which is a lower bound on the minimum pair distance. It is proved that the proposed LP decoder corrects up to ⌈dfp/2⌉ - 1 errors.
Original language | English |
---|---|
Title of host publication | Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1944-1948 |
Number of pages | 5 |
Volume | 2016-August |
ISBN (Electronic) | 9781509018062 |
DOIs | |
Publication status | Published - 2016 Aug 10 |
Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 2016 Jul 10 → 2016 Jul 15 |
Other
Other | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
---|---|
Country | Spain |
City | Barcelona |
Period | 16/7/10 → 16/7/15 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics