Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Rateless Codes With Unequal Error Protection Property
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we design several degree distributions for rateless codes with optimum intermediate packet recovery rates. In rateless coding, the employed degree distribution significantly affects the packet recovery rate. Each degree distribution is designed based on the number of message packets, k, and desired coding overhead, γ, which is the ratio of the number of received packets, n, to k, i.e., γ = n/k. Previously designed degree distributions are tuned for full recovery of the entire source packets for γ's slightly larger than 1, and as a consequence, they show very small packet recovery rates for γ k.