نتایج جستجو برای: symmetric channel section
تعداد نتایج: 453387 فیلتر نتایج به سال:
the developing turbulent flow in an open channel is a complex three-dimensional flow influenced by the secondary currents and free surface effects and is, therefore, not amenable to analytical solution. this paper aims to study the impact of three key hydraulic parameters (relative roughness, the froude number and the reynolds number) on the establishment length using computational fluid dynami...
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 ...
OF THE THESIS Properties of LDGM-LDPC codes With Applications to Secrecy Coding by Manik Raina Thesis Directors: Professor Predrag Spasojević The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly punctured outputbits. It is sh...
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds assuming iterative decoding. Two noise measures will be considered: the Bhattacharyya noise parameter, and the expected soft bit of the considered channel. An iterative m-dimensional lower bound is derived for Zm LDPC codes in symmetric channels, which gives a sufficient stability condition for Zm LDPC codes...
The symmetric linear deterministic interference channel (LD-IC) with partial feedback is considered. Partial feedback for the symmetric LD-IC models a scenario in which the top l most-significant-bits of the channel output of receiver j are received as feedback at transmitter j, for j = 1, 2. It is shown that the LD-IC with partial feedback can serve as a good approximation to the Gaussian inte...
We define a new family F̃w(X) of generating functions for w ∈ S̃n which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions such as their symmetry and conjecture certain positivity properties. As an application, we relate these functions to the k-Schur functions of Lapointe, Lascoux and Morse as well as the cylindric Schur functions of Postnikov. ...
An improved upper bound is given for the maximum attainable exponent of the error probability of maxlikelihood decoding on a binary symmetric channel (the reliability function of the channel). Disciplines Computer Sciences | Physical Sciences and Mathematics Comments Suggested Citation: Barg, A. and A. McGregor. (2003). "More on the reliability function of the BSC." Proceedings of the Internati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید