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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2170-2178
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE99A
Issue number12
DOIs
Publication statusPublished - 2016 Dec 1

Keywords

  • Fractional distance
  • Linear programming decoding
  • Low-density parity-check codes
  • Symbol-pair read channel

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Electrical and Electronic Engineering

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

  • Cite this