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

研究成果: Article査読

6 被引用数 (Scopus)

抄録

In this study, we develop a new algorithm for decoding binary linear codes for symbol-pair read channels. The symbol-pair read channel was recently introduced by Cassuto and Blaum to model channels with higher write resolutions than read resolutions. The proposed decoding algorithm is based on linear programming (LP). For LDPC codes, the proposed algorithm runs in time polynomial in the codeword length. 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 df p of the code, which is a lower bound on the minimum pair distance. It is proved that the proposed LP decoder corrects up to df p =2 - 1 errors.

本文言語English
ページ(範囲)2170-2178
ページ数9
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E99A
12
DOI
出版ステータスPublished - 2016 12

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「Linear programming decoding of binary linear codes for symbol-pair read channel」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル