Approximately optimal assignment for unequal loss protection

Adaptive Modulation for OFDM-Based Multiple Description Progressive Image Transmission

“…We employ a utility-cost function as in [6]. The utility measures the amount of benefit that the receiver is likely to achieve from receiving the packet, and the cost measures how much one has to pay to achieve a certain utility.…”

Joint product code optimization for scalable multimedia transmission over wireless channels

“…First, many RCPC code rates are eliminated very quickly. Second, the local search algorithm [10] used to improve an RS protection for a fixed code rate is faster than the previous algorithms [6,7,8].…”

“…The packet mean loss rate of the erasure channel is 0.05 and the bit error rate of the BSC is 0.1. The abbreviations Da, Db, P, and M denote the approach of [2] when the RS protection for each RCPC code rate was determined with the optimal algorithm of [8], algorithm B of [8], the algorithm of [6], and the algorithm of [7], respectively. LS is our local search algorithm (see Section 3).…”

“…The first method searches for an optimal RS protection for each RCPC code rate and selects the one with the lowest expected distortion [2]. For a given RCPC code rate, the RS protection was determined with the Lagrange-based algorithm of [6], the algorithm of [7], and the two algorithms of [8] denoted in the following by Da and Db. Note that the product code is optimal when Da is used.…”

“…We thank S. Dumitrescu, X. Wu, Z. Wang, D. Sachs, R. Anand, and K. Ramchandran for providing us with the C-codes of [8,6,2]. We also thank A. Mohr, R. Ladner, and E. Riskin for making the C-code of algorithm [7] available.…”