English
Related papers

Related papers: Anytime coding on the infinite bandwidth AWGN chan…

200 papers

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross

In this paper, we propose a physical-layer rateless code for wireless channels. A novel rateless encoding scheme is developed to overcome the high error floor problem caused by the low-density generator matrix (LDGM)-like encoding scheme in…

Information Theory · Computer Science 2013-06-25 Shuang Tian , Yonghui Li , Mahyar Shirvanimoghaddam , Branka Vucetic

The performance of Gallager's error-correcting code is investigated via methods of statistical physics. In this approach, the transmitted codeword comprises products of the original message bits selected by two randomly-constructed sparse…

Disordered Systems and Neural Networks · Physics 2009-10-31 Yoshiyuki Kabashima , Tatsuto Murayama , David Saad

A zero-error coding scheme of asymptotic rate $ \log_2 (1+\sqrt{5}) - 1 $ was recently described for a communication channel composed of parallel asynchronous lines satisfying the so-called no switch assumption. We prove that this is in…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević

In this paper, we consider orthogonal multiple access coding schemes, where correlated sources are encoded in a distributed fashion and transmitted, through additive white Gaussian noise (AWGN) channels, to an access point (AP). At the AP,…

Information Theory · Computer Science 2023-02-08 A. Abrardo , G. Ferrari , M. Martalo' , M. Franceschini , R. Raheli

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…

Quantum Physics · Physics 2008-11-14 Shengjun Wu , Xuemei Chen

We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties attempt to communicate reliably in the presence of an…

Information Theory · Computer Science 2020-01-07 Qiaosheng , Zhang , Matthieu R. Bloch , Mayank Bakshi , Sidharth Jaggi

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which…

Information Theory · Computer Science 2009-09-29 Wenyi Zhang , Urbashi Mitra

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…

Information Theory · Computer Science 2017-02-27 Richard J. Barton

A new coded modulation scheme is proposed. At the transmitter, the concatenation of a distribution matcher and a systematic binary encoder performs probabilistic signal shaping and channel coding. At the receiver, the output of a bitwise…

Information Theory · Computer Science 2015-04-23 Georg Böcherer , Patrick Schulte , Fabian Steiner

The use of open-loop coding can be easily extended to a closed-loop concatenated code if the channel has access to feedback. This can be done by introducing a feedback transmission scheme as an inner code. In this paper, this process is…

Information Theory · Computer Science 2011-02-23 Zachary Chance , David J. Love

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…

Information Theory · Computer Science 2013-01-15 Wentao Huang , Tracey Ho , Hongyi Yao , Sidharth Jaggi

In this paper we consider noisy index coding problem over AWGN channel. We give an algorithm to map the index coded bits to appropriate sized PSK symbols such that for the given index code, in general, the receiver with large amount of side…

Information Theory · Computer Science 2015-10-06 Anjana A. M. , B. Sundar Rajan

Fundamental limits of covert communication have been studied in literature for different models of scalar channels. It was shown that, over $n$ independent channel uses, $\mathcal{O}(\sqrt{n})$ bits can transmitted reliably over a public…

Information Theory · Computer Science 2018-03-15 Amr Abdelaziz , C. Emre Koksal

In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…

Information Theory · Computer Science 2017-01-05 Minh Au , Francois Gagnon

This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks of harvested energy, which is known…

Information Theory · Computer Science 2017-09-05 Silas L. Fong , Vincent Y. F. Tan , Ayfer Özgür

In wireless communication systems, Orthogonal Frequency-Division Multiplexing (OFDM) includes variants using either a cyclic prefix (CP) or a zero padding (ZP) as the guard interval to avoid inter-symbol interference. OFDM is ideally suited…

Signal Processing · Electrical Eng. & Systems 2020-08-18 Koosha Pourtahmasi Roshandeh , Mostafa Mohammadkarimi , Masoud Ardakani

The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry.…

Information Theory · Computer Science 2017-05-08 Jon Montalban , Jon Barrueco , Pablo Angueira , Jerrold D. Prothero