Name
Abstract | ||
|---|---|---|
This paper deals with precode-only (PCO) Raptor codes and Turbo fountain codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the amount of redundancy needed to decode the information bits. Following a previous paper, we give an exact expression for the average efficiency of maixmum-likelihood (ML) decoded Hamming codes and maximal-length codes. Moreover, we give an expression of the variance of the efficiency. Finally, we improve the bound on the efficiency of Turbo fountain codes, which are iteratively decoded. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISIT.2007.4557261 | 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 |
Keywords | Field | DocType |
upper bound,block codes,linear code,precoding,decoding,convolutional codes,awgn,hamming code,internet,fading,hamming codes,random variables,turbo codes,maximum likelihood,encoding | Discrete mathematics,BCJR algorithm,Luby transform code,Computer science,Fountain code,Turbo code,Block code,Serial concatenated convolutional codes,Algorithm,Theoretical computer science,Raptor code,Linear code | Conference |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Tarable | 1 | 86 | 13.42 |
| Sergio Benedetto | 2 | 53 | 7.89 |