Upper Bound on the Average Distortion of Multiple Description Coded Delay-Sensitive Sources
暂无分享,去创建一个
[1] Suhas N. Diggavi,et al. Network Resource Allocation for Competing Multiple Description Transmissions , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[2] Anthony Ephremides,et al. Multiple description coding in networks with congestion problem , 2001, IEEE Trans. Inf. Theory.
[3] Jonathan M. Pitts,et al. Tight bounds for the tail of the packet waiting time distribution in buffered networks , 2001, Int. J. Commun. Syst..
[4] Abbas El Gamal,et al. Achievable rates for multiple descriptions , 1982, IEEE Trans. Inf. Theory.
[5] Xinbing Wang,et al. Optimal scheduling for multiple description video streams in wireless multihop networks , 2009, IEEE Communications Letters.
[6] Vivek K. Goyal,et al. Multiple description coding: compression meets the network , 2001, IEEE Signal Process. Mag..
[7] L. Ozarow,et al. On a source-coding problem with two channels and three receivers , 1980, The Bell System Technical Journal.