Name
Abstract | ||
|---|---|---|
We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a check node in the decoding Tanner graph, the channel with small capacity leads to large decoding complexity. In this paper, we introduce a novel fountain coding scheme with non-binary LDPC codes. The decoding complexity of the proposed fountain code does not depend on the channel. Numerical experiments show that the proposed codes exhibit better performance than conventional fountain codes, especially for small number of information bits. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISTC.2010.5613905 | Turbo Codes and Iterative Information Processing |
Keywords | Field | DocType |
binary-input symmetric-output channel,fountain codes,nonbinary ldpc codes,radio receivers,decoding complexity,non-binary ldpc codes,tanner graph,parity check codes,information bits,decoding,rateless codes | Discrete mathematics,Concatenated error correction code,Luby transform code,Low-density parity-check code,Fountain code,Serial concatenated convolutional codes,Block code,Algorithm,Theoretical computer science,Raptor code,List decoding,Mathematics | Journal |
Volume | ISBN | Citations |
abs/1007.0 | 978-1-4244-6745-7 | 8 |
PageRank | References | Authors |
0.73 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. Kasai | 1 | 319 | 33.57 |
| Kohichi Sakaniwa | 2 | 330 | 47.69 |