A Simple Method to Calculate Random-Coding Union Bounds for Ultra-Reliable Low-Latency Communications
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Wireless Communications Letters"
DOI: 10.1109/lwc.2022.3149707
Abstract: Ultra-Reliable Low-Latency Communications are based on very short codes whose performances cannot be evaluated correctly by using the Shannon capacity formula holding for asymptotically large code lengths. The use of Random-Coding Union Bounds (RCUB’s) has… read more here.
Keywords: reliable low; ultra reliable; random coding; coding union ... See more keywords
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