Search
Search results for: shannon capacity
-
Shannon Capacity and Ramsey Numbers
PublicationRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
A survey on known values and bounds on the Shannon capacity
PublicationIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
Some Exact Values of Shannon Capacity for Evolving Systems
PublicationWe describe the notion of Shannon Capacity for evolving channels. Furthermore, using a computer search together with some theoretical results we establish some exact values of the measure.
-
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
PublicationIn this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games...
-
On practical application of Shannon theory to character recognition and more
PublicationLet us consider an optical character recognition system, which in particular can be used for identifying objects that were assigned strings of some length. The system is not perfect, for example, it sometimes recognizes wrongly the characters "Y" and "V". What is the largest set of strings of given length for the system under consideration, which can be mutually correctly recognized, and the corresponding objects correctly identified?...
-
On the independence number of some strong products of cycle-powers
PublicationIn 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 alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 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 results establish...
-
Average Redundancy of the Shannon Code for Markov Sources
PublicationIt is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...
-
Reliable underwater communication system for shallow coastal waters
PublicationThis paper presents a reliable and robust low data rate spread spectrum approach which is implemented in the acoustic underwater communication system for shallow coastal waters. It shows operation assumptions of spread spectrum techniques based on the wellknown Shannon equation. It describes two methods of spread spectrum: frequency hopping spread spectrum and direct sequence spread spectrum; their block diagram and their characteristics...
-
Flood Classification in a Natural Wetland for Early Spring Conditions Using Various Polarimetric SAR Methods
PublicationAbstract--- One of the major limitations of remote sensing flood detection is the presence of vegetation. Our study focuses on a flood classification using Radarsat-2 Quad-Pol data in a natural floodplain during leafless, dry vegetation (early spring) state. We conducted a supervised classification of a data set composed of nine polarimetric decompositions and Shannon entropy followed by the predictors' importance estimation to...
-
Seismic damage diagnosis in adjacent steel and RC MRFs considering pounding effects through improved wavelet-based damage-sensitive feature
PublicationThis paper aims to propose complex Morlet (cmorfb-fc) wavelet-based refined damage-sensitive feature (rDSF) as a new and more precise damage indicator to diagnose seismic damages in adjacent steel and Reinforced Concrete (RC) Moment Resisting Frames (MRFs) assuming pounding conditions using acceleration responses. The considered structures include 6- and 9-story steel and 4- and 8-story RC benchmark MRFs that are assumed to have...
-
METODA WYZNACZANIA ZŁOŻONOŚCI PODPRZESTRZENI STANÓW PLANSZOWYCH GIER LOGICZNYCH LOGICZNYCH
PublicationJedna z metod rozwiązywania gier jest analiza wsteczna. Jej skuteczność jest ograniczona wielkością przestrzeni stanów gry, która stanowi rozwiązywany problem. Pierwszego takiego oszacowania dokonał Claude E. Shannon odnośnie gry szachy w połowie minionego stulecia. Ważnym elementem jest podział takiej przestrzeni na mniejsze części, które mogą być rozwiązywane niezależnie lub z wykorzystaniem stosunkowo niewielkiej ilości informacji z...
-
Seismic damage diagnosis in adjacent steel and RC MRFs considering pounding effects through improved wavelet-based damage-sensitive feature
PublicationThis paper aims to propose complex Morlet (cmorfb-fc) wavelet-based refined damage-sensitive feature (rDSF) as a new and more precise damage indicator to diagnose seismic damages in adjacent steel and Reinforced Concrete (RC) Moment Resisting Frames (MRFs) assuming pounding conditions using acceleration responses. The considered structures include 6- and 9-story steel and 4- and 8-story RC benchmark...
-
Assessment of River Water Quality and Pollution Status Using Physicochemical and Biometrics, Awetu River, Ethiopia
PublicationThe surface water is contaminated by a variety of synthetic organic and inorganic compounds, chemicals, and nutrients; due to this reason, the quality of the water resources of Ethiopia is declining at an alarming rate, resulting in severe environmental degradation. The main objective of the study was to recognize the pollution status river for the study area by physicochemical parameters and the extent of microbial environmental...
-
On the Role of Polarimetric Decomposition and Speckle Filtering Methods for C-Band SAR Wetland Classification Purposes
PublicationPrevious wetlands studies have thoroughly verified the usefulness of data from synthetic aperture radar (SAR) sensors in various acquisition modes. However, the effect of the processing parameters in wetland classification remains poorly explored. In this study, we investigated the influence of speckle filters and decomposition methods with different combinations of filter and decomposition windows sizes on classification accuracy....
-
Automatic Regularization by Quantization in Reducible Representations of CCR: Point-Form Quantum Optics with Classical Sources
PublicationElectromagnetic fields are quantized in a manifestly covariant way by means ofa class of reducible "center-of-mass N-representations" of the algebra of canonical commutationrelations (CCR). The four-potential Aa(x) transforms in these representations as aHermitian four-vector field in Minkowski four-position space (without change of gauge), butin momentum space it splits into spin-1 massless photons and two massless scalars. Whatwe...
-
On zero-error codes produced by greedy algorithms
PublicationWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.