Linear programming decoding of binary linear codes for symbol-pair read channels

Shunsuke Horii; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/ISIT.2016.7541638

Linear programming decoding of binary linear codes for symbol-pair read channels

Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa

Global Education Center

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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 d_fp of the code which is a lower bound on the minimum pair distance. It is proved that the proposed LP decoder corrects up to ⌈d_fp/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	https://doi.org/10.1109/ISIT.2016.7541638
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

Access to Document

10.1109/ISIT.2016.7541638

Fingerprint Dive into the research topics of 'Linear programming decoding of binary linear codes for symbol-pair read channels'. Together they form a unique fingerprint.

Cite this

Horii, S., Matsushima, T., & Hirasawa, S. (2016). Linear programming decoding of binary linear codes for symbol-pair read channels. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (Vol. 2016-August, pp. 1944-1948). [7541638] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541638

Linear programming decoding of binary linear codes for symbol-pair read channels. / Horii, Shunsuke ; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. p. 1944-1948 7541638.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Horii, S , Matsushima, T & Hirasawa, S 2016, Linear programming decoding of binary linear codes for symbol-pair read channels. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. vol. 2016-August, 7541638, Institute of Electrical and Electronics Engineers Inc., pp. 1944-1948, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 16/7/10. https://doi.org/10.1109/ISIT.2016.7541638

@inproceedings{9f45f3dd331b4d1caa415cfe6a611d64,

title = "Linear programming decoding of binary linear codes for symbol-pair read channels",

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.",

author = "Shunsuke Horii and Toshiyasu Matsushima and Shigeichi Hirasawa",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541638",

language = "English",

volume = "2016-August",

pages = "1944--1948",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

}

TY - GEN

T1 - Linear programming decoding of binary linear codes for symbol-pair read channels

AU - Horii, Shunsuke

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84985905309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84985905309&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541638

DO - 10.1109/ISIT.2016.7541638

M3 - Conference contribution

AN - SCOPUS:84985905309

VL - 2016-August

SP - 1944

EP - 1948

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -