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