- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels (in Japanese) |
|---|---|
| Authors | Shunsuke Horii 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2016 |
| Format | Journal |
| Category | Others |
| Jounal Name | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| Jounal Page | vol.E99-A, No.12, pp.2170-2178 |
| Published Year | 2016 |
| Published Month | 12 |
| Abstract （English） |
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 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 $\left\lceil dfp/2\right\rceil -1$ errors. |
| Note （English） |
3 |
| Manuscript | |
| Presentation |
Involved Papers
- A New Latent Class Model for Analysis of Purchasing and Browsing Histories on EC Sites
- A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- Parallel Encoder and Decoder Architecture for Cyclic Codes
- A Generalization of B.S.Clarke and A.R.Barron's Asymptotics of Bayes Codes for FSMX Sources
- Almost Sure and Mean Convergence of Extended Stochastic Complexity
- A Source Model with Probability Distribution over Word Set and Recurrence Time Theorem
- Properties of a Word-Valued Source with a Non-prefix-free Word Set
- Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification
- An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
- On the Overflow Probability of Fixed - to - Variable Length Codes with Side Information
- A Study on the Degrees of Freedom in an Experimental Design Model Based on an Orthonormal System
- A Note on Relation between the Fourier Coefficients and the Effects in the Experimental Design
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel
- A Note on Automatic Construction Algorithms for Orthogonal Designs of Experiments Using Error-correcting Codes
- A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes
- Estimation of the Effects in the Experimental Design using Fourier Transforms
- A Note on a Sampling Theorem for Functions over $GF(q)^n$ Domain
- On Precise Achievable Conditions in Resolvability Problem Based on the Asymptotic Normality
