Name
Abstract | ||
|---|---|---|
We show how to construct an algorithm to search for binary idempotents which
may be used to construct binary LDPC codes. The algorithm, which allows control
of the key properties of sparseness, code rate and minimum distance, is
constructed in the Mattson-Solomon domain. Some of the new codes, found by
using this technique, are displayed. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1049/ip-com:20050415 | Communications, IEE Proceedings- |
Keywords | Field | DocType |
information theory,ldpc code,sparse coding | Discrete mathematics,Concatenated error correction code,Combinatorics,Low-density parity-check code,Serial concatenated convolutional codes,Block code,Expander code,Reed–Solomon error correction,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
153 | 2 | 1350-2425 |
Citations | PageRank | References |
6 | 0.66 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Horan | 1 | 6 | 1.00 |
| C. Tjhai | 2 | 24 | 6.02 |
| Martin Tomlinson | 3 | 106 | 19.89 |
| A. Ambroze | 4 | 70 | 13.00 |
| Mohammed Ahmed | 5 | 8 | 2.50 |