In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C 10) ) = 30 and α((C 14) ) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our...

We address the problem of simulating an arbitrary binary interactive first-order Markovian protocol over a pair of binary symmetric channels with crossover probability ε. We are interested in the achievable rates of reliable simulation, i.e., in characterizing the smallest possible blowup in communications such that a vanishing error probability (in the protocol length) can be attained. Whereas...

The objective of this paper is to derive the channel transition probabilities for the reader–to–tag link in RFID, considering the peculiar receiver structure in a RFID tag. The model is a first necessary step to derive Maximum Likelihood receivers and also the Shannon capacity of the link.

Claude Shannon founded information theory in the 1940s. The theory has long been known to be closely related to thermodynamics and physics through the similarity of Shannon's uncertainty measure to the entropy function. Recent work using information theory to understand molecular biology has unearthed a curious fact: Shannon's channel capacity theorem only applies to living organisms and their ...

In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binar...

The Shannon Capacity equation defines the total data transmission capacity of a transmission channel as a function of receiver SNR and bandwidth. When frequencyoverlapped (FO) duplex mode of operation with an echo canceller is implemented on a digital subscriber loop (DSL) channel, then the near-end receiver SNR that determines the inbound capacity is not only a function of the far-end transmit...

We here compare the limit performance asynchronous DS-CDMA systems based on different set of spreading sequences, namely chaos-based, ideal random, Gold codes and maximum-length codes. To do so we consider the Shannon capacity associated to each of those systems that is itself a random variable depending on the relative delays and phases between different users. The statistical features of such...

The main reason behind the complexity of codingdecoding scheme is the randomness in the source or channel noise. We model source or channel noise as pseudo-random to study the limitation of coding-decoding schemes in the presence of an adversary. In this adverserial model, we characterize the limitations of computationally bounded source and channel coding-decoding schemes in terms of classical...

This paper considers the Multiple Input Multiple Output (MIMO) capacity enhancement considering the Universal Mobile Telecommunication System (UMTS) Long Term Evolution (LTE) technology, in the downlink, including the effects of system bandwidth and Signal-to-Noise Ratio (SNR) efficiency. Firstly, the system bandwidth efficiency is calculated for LTE framework. It becomes 63% for Single Input S...

The laws of Nyquist and Shannon govern the world of data communications—the information carrying capacity of a channel is a function of the channel’s bandwidth and noise. In wired networks, we have developed ways to reduce noise and increase the channel’s bandwidth. In many respects, the bounded media of the wired world has almost boundless channel capacity. However, in wireless communications ...