English
Related papers

Related papers: Performance Comparison of Reed Solomon Code and BC…

200 papers

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares…

Information Theory · Computer Science 2017-02-27 Amogh Rajanna , Martin Haenggi

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

We discuss the performance of polar codes, the capacity-achieving channel codes, on wireless communication channel in this paper. By generalizing the definition of Bhattacharyya Parameter in discrete memoryless channel, we present the…

Information Theory · Computer Science 2012-04-30 Peng Shi , Shengmei Zhao , Bei Wang

In this paper, we investigate the impact of Forward Error Correction (FEC) codes namely Cyclic Redundancy Code and Convolution Code on the performance of OFDM wireless communication system for speech signal transmission over both AWGN and…

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

Information Theory · Computer Science 2014-10-28 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Nicola Laurenti , Stefano Tomasin , Francesco Renna

This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh block-fading channels. A heavily coded system corresponds to a low transmission rate with few ARQ re-transmissions, whereas lighter coding…

Information Theory · Computer Science 2015-03-13 Peng Wu , Nihar Jindal

We present a general method for the error analysis of spatial modulation (SM) systems over correlated and uncorrelated Rayleigh and Rician fading channels. The proposed method, making use of the properties of proper complex random variables…

Information Theory · Computer Science 2011-09-27 Mutlu Koca , Hikmet Sari

This paper re-examines the well-known fundamental tradeoffs between rate and reliability for the multi-antenna, block Rayleigh fading channel in the high signal to noise ratio (SNR) regime when (i) the transmitter has access to (noiseless)…

Information Theory · Computer Science 2007-07-17 Masoud Sharif , Prakash Ishwar

This study addresses the use of Reed-Solomon error correction codes in QR codes to enhance resilience against failures. To fully grasp this approach, a basic cryptographic context is provided, necessary for understanding Reed-Solomon codes.…

Information Theory · Computer Science 2024-07-25 Bhavuk Sikka Bajaj

This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a…

Information Theory · Computer Science 2025-11-19 Chao Qi , Tobias Koch

In this paper, performance of hybrid automatic repeat request with incremental redundancy (HARQ-IR) over Rayleigh fading channels is investigated. Different from prior analysis, time correlation in the channels is considered. Under…

Information Theory · Computer Science 2022-09-30 Zheng Shi , Haichuan Ding , Shaodan Ma , Kam-Weng Tam

We show that linear codes combined with rejection sampling can yield a capacity-achieving scheme for simulating additive exchangeable noise channels. Specifically, our scheme achieves an amount of communication within $\log e + 1$ bits from…

Information Theory · Computer Science 2026-01-21 Jianguo Zhao , Cheuk Ting Li

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

A wideband fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to [6]) is shown to achieve the…

Information Theory · Computer Science 2007-07-13 Shashi Borade , Lizhong Zheng

We study a variant of unequal error protection in channel coding, where the message bit string is divided into a finite number of blocks and the maximization objective is a weighted sum of per-block decoding success probabilities. The…

Information Theory · Computer Science 2026-04-09 Adeel Mahmood

We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based…

Information Theory · Computer Science 2016-11-09 J. Van Wonterghem , A. Alloum , J. J. Boutros , M. Moeneclaey

Channel uncertainty and co-channel interference are two major challenges in the design of wireless systems such as future generation cellular networks. This paper studies receiver design for a wireless channel model with both time-varying…

Information Theory · Computer Science 2009-10-15 Yan Zhu , Dongning Guo , Michael L. Honig

For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when…

Information Theory · Computer Science 2016-11-02 Oliver Wilhelm Gnilke , Ha Thanh Nguyen Tran , Alex Karrila , Camilla Hollanti

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra
‹ Prev 1 2 3 10 Next ›