On Random-Coding Union Bounds With and Without Erasures
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2018.2825357
Abstract: Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union… read more here.
Keywords: without erasures; union bounds; bounds without; random coding ... See more keywords