The Experts below are selected from a list of 327 Experts worldwide ranked by ideXlab platform
M. V. Burnashev - One of the best experts on this subject based on the ideXlab platform.
-
On Reliability Function Of BSC: Expanding The Region, Where It Is Known Exactly.
arXiv: Information Theory, 2016Co-Authors: M. V. BurnashevAbstract:The region of rates ("straight-line"), where the BSC Reliability Function is known exactly, is expanded.
-
ISIT - New Results on the Reliability Function of the Gaussian Channel
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: M. V. BurnashevAbstract:A new approach for upper bounding the channel Reliability Function using the code spectrum is described. It allows both low and high rate cases to be treated in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
-
Code spectrum and Reliability Function: Gaussian channel
arXiv: Information Theory, 2007Co-Authors: M. V. BurnashevAbstract:A new approach for upper bounding the channel Reliability Function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
-
Code spectrum and the Reliability Function: Gaussian channel
Problems of Information Transmission, 2007Co-Authors: M. V. BurnashevAbstract:A new approach to upper bounding the channel Reliability Function using the code spectrum is described. It allows us to treat both the low and high rate cases in a unified way. In particular, previously known upper bounds are improved and a new derivation of the sphere-packing bound is presented.
-
Supplement to: Code Spectrum and Reliability Function: Binary Symmetric Channel
arXiv: Information Theory, 2007Co-Authors: M. V. BurnashevAbstract:A much simpler proof of Theorem 1 from M.Burnashev "Code spectrum and Reliability Function: Binary symmetric channel" is presented.
Simon Litsyn - One of the best experts on this subject based on the ideXlab platform.
-
Improved Upper Bounds on the Reliability Function of the Gaussian Channel
IEEE Transactions on Information Theory, 2008Co-Authors: Yael Ben-haim, Simon LitsynAbstract:A new lower bound on the distance distribution of spherical codes is derived. This yields two new upper bounds on the Reliability Function of the Gaussian channel. These bounds outperform previously known bounds, and imply a new range of rates for which the exact value of the Reliability Function is known.
-
ISIT - Improved Upper Bounds on the Reliability Function of the Gaussian Channel
2006 IEEE International Symposium on Information Theory, 2006Co-Authors: Y. Ben-haim, Simon LitsynAbstract:A new lower bound on the distance distribution of spherical codes is derived. This yields two new upper bounds on the Reliability Function of the Gaussian channel. These bounds outperform previously known bounds, and imply a new range of rates for which the exact value of the Reliability Function is known.
M. V. Burnashev - One of the best experts on this subject based on the ideXlab platform.
-
On the BSC Reliability Function: Expanding the region where it is known exactly
Problems of Information Transmission, 2015Co-Authors: M. V. BurnashevAbstract:We extend the “straight-line” region of transmission rates for which the BSC Reliability Function is known exactly.
-
On the Reliability Function for a noisy feedback Gaussian channel: Zero rate
Problems of Information Transmission, 2012Co-Authors: M. V. Burnashev, H. YamamotoAbstract:A discrete-time channel with independent additive Gaussian noise is used for information transmission. There is also a feedback channel with independent additive Gaussian noise, and the transmitter observes all outputs of the forward channel without delay via this feedback channel. Transmission of a nonexponential number of messages is considered (i.e., the transmission rate is zero), and the achievable decoding error exponent for such a combination of channels is investigated. It is shown that for any finite noise in the feedback channel the achievable error exponent is better than the similar error exponent for a no-feedback channel. The transmission/decoding method developed in the paper strengthens the method earlier used by the authors for a BSC. In particular, for small feedback noise, it provides a gain of 23.6% (instead of 14.3% obtained earlier for a BSC).
-
On the Reliability Function for a BSC with noisy feedback
Problems of Information Transmission, 2010Co-Authors: M. V. Burnashev, H. YamamotoAbstract:A binary symmetric channel is used for information transmission. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all outputs of the forward channel via the feedback channel. Transmission of an exponential number of messages is considered (i.e., the transmission rate is positive). The achievable decoding error exponent for this combination of channels is studied. It is shown that if the crossover probability of the feedback channel is less than a certain positive value, then the achievable error exponent is better than the decoding error exponent of a channel without feedback.
-
Code spectrum and the Reliability Function: Binary symmetric channel
Problems of Information Transmission, 2006Co-Authors: M. V. BurnashevAbstract:A new approach for upper bounding the channel Reliability Function using the code spectrum is described. It allows to treat both the low and high rate cases in a unified way. In particular, previously known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
-
Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric Channel
Problems of Information Transmission, 2005Co-Authors: M. V. BurnashevAbstract:An upper bound for the Reliability Function of a binary symmetric channel is improved.
Yael Ben-haim - One of the best experts on this subject based on the ideXlab platform.
-
Improved Upper Bounds on the Reliability Function of the Gaussian Channel
IEEE Transactions on Information Theory, 2008Co-Authors: Yael Ben-haim, Simon LitsynAbstract:A new lower bound on the distance distribution of spherical codes is derived. This yields two new upper bounds on the Reliability Function of the Gaussian channel. These bounds outperform previously known bounds, and imply a new range of rates for which the exact value of the Reliability Function is known.
Mohd Arshad - One of the best experts on this subject based on the ideXlab platform.
-
umvu estimation of Reliability Function and stress strength Reliability from proportional reversed hazard family based on lower records
American Journal of Mathematical and Management Sciences, 2016Co-Authors: M J S Khan, Mohd ArshadAbstract:SYNOPTIC ABSTRACTIn this study, we have obtained the uniformly minimum variance unbiased estimator (UMVUE) of Reliability Function and stress–strength Reliability for one parameter proportional reversed hazard rate family of distribution based on lower record values. Further, the results are reduced for power Function distribution, exponentiated Weibull distribution, generalized exponential distribution, generalized Rayleigh (also known as Burr type X) distribution and Topp–Leone distribution. Also, the UMVU estimator and maximum likelihood estimator are compared through simulation.
