Comments on "optimal erasure protection for scalably compressed video streams with limited retransmission".
In order to prove a key result for their development (Lemma 2), Taubman and Thie need the assumption that the upper boundary of the convex hull of the channel coding probability-redundancy characteristic is sufficiently dense. Since a floor value for the density level for which the claim to hold is not specified, it is not clear whether their lemma applies to practical situations. In this correspondence, we show that the constraint of sufficient density can be removed, and, thus, we validate the conclusion of the lemma for any scenario encountered in practice.
Dumitrescu
Sorina
S
D000465:Algorithms; D001185:Artificial Intelligence; D003196:Computer Graphics; D016494:Computer Security; D003199:Computer Systems; D044962:Data Compression / Q000379:methods*; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D019212:Multimedia; D009716:Numerical Analysis, Computer-Assisted; D012815:Signal Processing, Computer-Assisted; D014741:Video Recording / Q000379:methods*