A Unified Random Coding Bound
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2018.2864731
Abstract: In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source–channel coding, and coding for computing problems assuming blockwise node… read more here.
Keywords: network; random coding; bound; channel ... See more keywords