نتایج جستجو برای: symmetric compound channel
تعداد نتایج: 426740 فیلتر نتایج به سال:
در این پایان نامه بر مقاله ی an iterative method for the symmetric and skew symmetric solutions of a linear matrix equation axb+cyd =e نوشته ی xingping sheng و guoliang chen، مروری داشته ایم. در این مقاله دو روش تکراری برای حل معادله ی ماتریسی خطی axb+cyd=e ارائه شده است. روش اول جواب معادله را به صورت متقارن و روش دوم جواب معادله را به صورت پادمتقارن ارائه می دهد. تعدادی مثال های عددی را با...
this study seeks to examine how a company can select the best intermediary for its marketing channels with minimum of criteria and time. a theoretical framework is proposed based on the most important tasks of intermediary and the criteria to measure them. there are four basic tasks and thirty criteria in three independent levels. subsequently, an exploratory case study in iranian food industry...
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with informed decoder. Our approach in the finite c...
Generalized Degrees of Freedom (GDoF) are characterized for the symmetric K-user Multiple Input Multiple Output (MIMO) Interference Channel (IC) under the assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. In this symmetric setting, each transmitter is equipped with M antennas, each receiver is equipped with N antennas, each desired channel ...
We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new outer bound to show that a proposed achievable scheme can achieve the symmetric capacity to within 1.7075 bits for all channel parameters. From this result, we ...
We prove the Courtade-Kumar conjecture, for several classes of n-dimensional Boolean functions, for all n ≥ 2 and for all values of the error probability of the binary symmetric channel, 0 ≤ p ≤ 1 2 . This conjecture states that the mutual information between any Boolean function of an n-dimensional vector of independent and identically distributed inputs to a memoryless binary symmetric channe...
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because in a cryptographic setting, these noisy channels must satisfy very strong security requirements. Unfair noisy channels, introduced by Damg̊ard, Kilian and Salvail [Eurocrypt ’99], reduce these limitations: They give the ...
A Multi-Channel Algebraic Scattering (MCAS) theory is presented with which the properties of a compound nucleus are found from a coupled-channel problem. The method defines both the bound states and resonances of the compound nucleus, even if the compound nucleus is particle unstable. All resonances of the system are found no matter how weak and/or narrow. Spectra of mass-7 nuclei and of F, and...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید