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
Finite Blocklength Analysis of Gaussian Random Coding in AWGN Channels Under Covert Constraint
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Information Forensics and Security"
DOI: 10.1109/tifs.2020.3032292
Abstract: It is well known that finite blocklength analysis plays an important role in evaluating performances of communication systems in practical settings. This paper considers the achievability and converse bounds on the maximal channel coding rate… read more here.
Keywords: random coding; communication; constraint; finite blocklength ... See more keywords
Random Coding Error Exponents for the Two-User Interference Channel
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2016.2630707
Abstract: This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the… read more here.
Keywords: exponents two; error exponents; random coding; interference ... 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
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
Random coding method for SNR enhancement of BOTDR.
Sign Up to like & getrecommendations! Published in 2022 at "Optics express"
DOI: 10.1364/oe.456620
Abstract: A random coding method for a Brillouin optical time domain reflectometer (BOTDR) fiber sensor is proposed. In this method, a series of pulses modulated by random code are injected into the optical fiber to enhance… read more here.
Keywords: botdr; coding method; peak power; snr enhancement ... See more keywords