Name
Abstract | ||
|---|---|---|
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m), where m > 0 cyclic low-density parity- check codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to increment the code dimension by adding more idempotents and so steadily decrease the sparseness of the parity-check matrix. We show that the constructed codes can achieve performance very close to the sphere-packing-bound constrained for binary transmission. |
Year | Venue | Keywords |
|---|---|---|
2005 | Turbo Codes&Related Topics; 6th International ITG-Conference Source and Channel Coding | mattson- solomon polynomial,— coding,idempotent,non binary ldpc,sphere packing |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Polynomial,Matrix (mathematics),Low-density parity-check code,Cyclic code,Linear code,Idempotence,Coset,Mathematics,Dual code | Journal | abs/cs/050 |
ISBN | Citations | PageRank |
978-3-8007-2947-0 | 2 | 0.68 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Tjhai | 1 | 24 | 6.02 |
| Martin Tomlinson | 2 | 106 | 19.89 |
| R. Horan | 3 | 2 | 0.68 |
| mohammed zaki ahmed | 4 | 16 | 6.01 |