English
Related papers

Related papers: The AWGN Red Alert Problem

200 papers

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at…

Information Theory · Computer Science 2007-07-13 Hamid Farmanbar , Amir K. Khandani

Optimal transport has numerous applications, particularly in machine learning tasks involving generative models. In practice, the transportation process often encounters an information bottleneck, typically arising from the conversion of a…

Information Theory · Computer Science 2024-12-30 Xiqiang Qu , Ruibin Li , Jun Chen , Lei Yu , Xinbing Wang

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

This work establishes that the physical layer can be used to perform information-theoretic authentication in additive white Gaussian noise channels, as long as the adversary is not omniscient. The model considered consists of an encoder,…

Information Theory · Computer Science 2021-11-12 Eric Graves , Allison Beemer , Jorg Kliewer , Oliver Kosut , Paul Yu

Due to data dependency and model leakage properties, Deep Neural Networks (DNNs) exhibit several security vulnerabilities. Several security attacks exploited them but most of them require the output probability vector. These attacks can be…

Cryptography and Security · Computer Science 2019-02-01 Faiq Khalid , Hassan Ali , Muhammad Abdullah Hanif , Semeen Rehman , Rehan Ahmed , Muhammad Shafique

We consider a point-to-point communication system, where in addition to the encoder and the decoder, there is a helper that observes non-causally the realization of the noise vector and provides a (lossy) rate-$R_{\mbox{\tiny h}}$…

Information Theory · Computer Science 2020-11-23 Neri Merhav

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in which constellation shaping and channel coding are combined. PAS has attracted considerable attention in both wireless and optical communications. Achievable…

Information Theory · Computer Science 2020-07-14 Yunus Can Gültekin , Alex Alvarado , Frans M. J. Willems

We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, universally achievable error exponents are offered for decoding with an erasure option…

Information Theory · Computer Science 2009-03-13 Erez Sabbag , Neri Merhav

I. This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of…

Quantum Physics · Physics 2007-05-23 Alexei Ashikhmin , Alexander Barg , Emanuel Knill , Simon Litsyn

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

Information Theory · Computer Science 2019-04-24 Cynthia Rush , Ramji Venkataramanan

We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels…

Information Theory · Computer Science 2015-01-13 Harish Vangala , Emanuele Viterbo , Yi Hong

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

Information Theory · Computer Science 2024-12-10 Michael Peleg , Shlomo Shamai

This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. The proposed method is applicable to various channels and ensembles. The focus is on both…

Information Theory · Computer Science 2022-03-01 Ralf R. Müller

We consider a linear multi-hop network composed of multi-state discrete-time memoryless channels over each hop, with orthogonal time-sharing across hops under a half-duplex relaying protocol. We analyze the probability of error and…

Information Theory · Computer Science 2008-10-29 Ozgur Oyman

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…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Matthieu R. Bloch

Several communication models that are of relevance in practice are asymmetric in the way they act on the transmitted "objects". Examples include channels in which the amplitudes of the transmitted pulses can only be decreased, channels in…

Information Theory · Computer Science 2022-12-29 Mladen Kovačević , Dejan Vukobratović

We consider communication over the AWGN channel with a transmitter whose battery is recharged with RF energy transfer at random times known to the receiver. We assume that the recharging process is i.i.d. Bernoulli. We characterize the…

Information Theory · Computer Science 2015-06-10 Dor Shaviv , Ayfer Ozgur

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›