On Sphere{packing Bound, Capacity and Related Results for Poisson Channel
نویسنده
چکیده
|A new approach for getting upperbounds for the capacity and the error exponent of the Poisson channel is proposed. It is based on a new sphere{packing lowerbound for the error probability. Strong converse for the coding theorem is also established.
منابع مشابه
The Sphere Packing Bound via Augustin's Method
The channel coding problem is reviewed for an abstract framework. If the scaled Renyi capacities of a sequence of channels converge to a finite continuous function φ on an interval of the form (1− ε, 1] for an ε > 0, then the capacity of the sequence of channels is φ(1). If the convergence holds on an interval of the form (1 − ε, 1 + ε) then the strong converse holds. Both hypotheses hold for l...
متن کاملOn Bounds for $E$-capacity of DMC
–Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for E-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple...
متن کاملHow to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To beat the bound, the problem must be changed. While it has long been known that variable-length block codes can do better when trading-off error probability with e...
متن کاملA New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) results in a ti...
متن کاملLovász's theta function, Rényi's divergence and the sphere-packing bound
Lovász’s bound to the capacity of a graph and the the sphere-packing bound to the probability of error in channel coding are given a unified presentation as information radii of the Csiszár type using the Rényi divergence in the classical-quantum setting. This brings together two results in coding theory that are usually considered as being of a very different nature, one being a “combinatorial...
متن کامل