Name
Title | ||
|---|---|---|
Three-edge type LDPC code ensembles with exponentially few codewords with linear small weight |
Abstract | ||
|---|---|---|
Multi-edge type LDPC codes are introduced by Richardson and Urbanke, and they show examples of their ensembles have better performance than other known ensembles. Orlitsky et al. derived the condition for irregular LDPC code ensembles with minimum distance linearly increasing in code length. Nakasendo et al. derived the condition that code ensembles have exponentially decreasing small linear weight codewords for two-edge type LDPC code ensembles which is simple example of multi-edge type LDPC code ensembles. In this paper, we derive the condition for three-edge type LDPC code ensembles whose edge-types does not share any variable node and does share all of the check nodes with exponentially decreasing small linear weight codewords. The condition is necessary for the existence of the average relative minimum distance of ensembles. Our method is expected to derive the condition for multi-edge type LDPC codes. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISITA.2008.4895505 | Auckland |
Keywords | DocType | ISBN |
parity check codes,code length,exponentially few codewords,irregular ldpc code ensembles,linear small weight,linear weight codewords,multi-edge type ldpc codes,three-edge type ldpc code ensembles,two-edge type ldpc code ensembles,ldpc code | Conference | 978-1-4244-2069-8 |
Citations | PageRank | References |
3 | 0.49 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Nakasendo | 1 | 3 | 0.49 |
| K. Kasai | 2 | 319 | 33.57 |
| Shibuya, T. | 3 | 4 | 1.28 |
| Kohichi Sakaniwa | 4 | 330 | 47.69 |