Results 11 to 20 of about 321,688 (264)
We consider communication over channels whose statistics are not known in full, but can be parameterized as a finite family of memoryless channels. A typical approach to address channel uncertainty is to design codes for the worst channel in the family, resulting in the well-known compound channel capacity.
Michael Langberg, Oron Sabag
openaire +3 more sources
Capacity of Steganographic Channels [PDF]
This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question, a formal definition of steganographic capacity is presented. Once this has been defined, a general formula for the capacity is developed.
Jeremiah J. Harmsen, William A. Pearlman
openaire +2 more sources
The Capacity of Channels With Feedback [PDF]
We introduce a general framework for treating channels with memory and feedback. First, we generalize Massey's concept of directed information and use it to characterize the feedback capacity of general channels. Second, we present coding results for Markov channels. This requires determining appropriate sufficient statistics at the encoder and decoder.
Mitter, Sanjoy K., Tatikonda, Sekhar
openaire +4 more sources
Interactive channel capacity [PDF]
We study the interactive channel capacity of an e-noisy channel. The interactive channel capacity C(e) is defined as the minimal ratio between the communication complexity of a problem (over a non-noisy channel), and the communication complexity of the same problem over the binary symmetric channel with noise rate e, where the communication complexity ...
Gillat Kol, Ran Raz
openaire +2 more sources
The channel capacity of the ribosome
Translation is one of the most fundamental processes in the biological cell. Because of the central role that translation plays across all domains of life, the enzyme that carries out this process, the ribosome, is required to process information with high accuracy. This accuracy often approaches values near unity experimentally.
Daniel A. Inafuku +5 more
openaire +2 more sources
Channel coding: The road to channel capacity [PDF]
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance vs.
Daniel J. Costello Jr. +1 more
openaire +2 more sources
On the Capacity of Channels With Deletions and States [PDF]
We consider the class of channels formed from the concatenation of a deletion channel and a finite-state channel. For this class of channels, we show that the operational capacity is equal to the stationary capacity, which can be approached by a sequence of Markov processes with increasing Markovian orders.
Yonglong Li, Vincent Y. F. Tan
openaire +2 more sources
Channel Capacity Bounds in the Presence of Quantized Channel State Information
The goal of this paper is to investigate the effect of channel side information on increasing the achievable rates of continuous power-limited non-Gaussian channels. We focus on the case where (1) there is imperfect channel quality information available
Behrooz Makki +2 more
doaj +2 more sources
The F composite fading model was recently proposed as an accurate and tractable statistical model for the characterization of the composite fading conditions encountered in realistic wireless communication scenarios.
Seong Ki Yoo +6 more
doaj +1 more source
Research on capacity region of Gaussian degraded relay broadcast channel
Considering the relay broadcast channel (RBC),the transmitter communicates with two receivers with the assistance of a relay.Based on degradation orders among the relay and the receiver outputs,three types of physically degraded RBCs (PDRBCs) model are ...
Ma Yingying, Wang Ke, Wu Youlong
doaj +1 more source

