Abstract
We propose transformation of a parity-check matrix of any low-density parity-check code. A code with transformed parity-check matrix is an equivalent of a code with the original parity-check matrix. For the binary erasure channel, performance of a message-passing algorithm with a transformed parity-check matrix is better than that with the original matrix.
| Original language | English |
|---|---|
| Pages (from-to) | 1299-1302 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E89-A |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2006 May |
Keywords
- Binary erasure channel
- Generalized parity-check matrix
- Low-density parity-check code
- Sum-product algorithm
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics
Fingerprint Dive into the research topics of 'Transformation of a Parity-check matrix for a message-passing algorithm over the BEC'. Together they form a unique fingerprint.
Cite this
Kobayashi, N., Matsushima, T., & Hirasawa, S. (2006). Transformation of a Parity-check matrix for a message-passing algorithm over the BEC. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A(5), 1299-1302. https://doi.org/10.1093/ietfec/e89-a.5.1299