中文
相关论文

相关论文: Finite Blocklength Analysis of Gaussian Random cod…

200 篇论文

This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the…

信息论 · 计算机科学 2020-07-08 Xinchun Yu , Shuangqin Wei , Yuan Luo

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

信息论 · 计算机科学 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication…

信息论 · 计算机科学 2017-02-01 Shihao Yan , Biao He , Yirui Cong , Xiangyun Zhou

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding…

信息论 · 计算机科学 2025-07-21 Shi-Yuan Wang , Matthieu R. Bloch

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

信息论 · 计算机科学 2017-11-15 Deekshith P K , Vinod Sharma

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical…

信息论 · 计算机科学 2026-01-15 Sheng Su , Yuhan Yang , Chao Qi , Xuan He , Bin Dai , Xiaohu Tang

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The…

信息论 · 计算机科学 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy

This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $\delta$ of Kullback-Leibler divergence (KL divergence). It is…

信息论 · 计算机科学 2026-04-08 Xinchun Yu , Shuangqing Wei , Shao-Lun Huang , Xiao-Ping Zhang

We derive upper and lower bounds for the covert capacity of Additive White Gaussian Noise channels when measuring reliability in terms of the average error probability and covertness in terms of Kullback-Leibler divergence. This…

信息论 · 计算机科学 2025-06-18 C. Bouette , L. Luzzi , M. Bloch

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…

信息论 · 计算机科学 2018-01-12 Oliver Kosut , Joerg Kliewer

We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…

信号处理 · 电气工程与系统科学 2021-01-25 Ahmed Bendary , Amr Abdelaziz , C. Emre Koksal

This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…

信息论 · 计算机科学 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the…

信息论 · 计算机科学 2008-05-15 Jaspreet Singh , Onkar Dabeer , Upamanyu Madhow

In this paper, we derive upper and lower bounds as well as a simple closed-form approximation for the capacity of the continuous-time, bandlimited, additive white Gaussian noise channel in a three-dimensional free-space electromagnetic…

信息论 · 计算机科学 2017-02-27 Richard J. Barton

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

信息论 · 计算机科学 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

信息论 · 计算机科学 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

信息论 · 计算机科学 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

Recent advances in deep learning for wireless communications have renewed interest in channel output feedback codes. In the additive white Gaussian broadcast channel with feedback (AWGN-BC-F), feedback can expand the channel capacity region…

信号处理 · 电气工程与系统科学 2025-12-02 Jacqueline Malayter , Yingyao Zhou , Natasha Devroye , Chih-Chun Wang , Christopher Brinton , David J. Love

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…

信息论 · 计算机科学 2016-11-17 Ligong Wang , Gregory Wornell , Lizhong Zheng

In this paper, we consider single- and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the…

信息论 · 计算机科学 2016-09-22 Lan V. Truong , Silas L. Fong , Vincent Y. F. Tan
‹ 上一页 1 2 3 10 下一页 ›