A Simple Derivation of the Refined SPB for the Constant Composition Codes

Download

index.pdf

Date

2019-07-01

Author

Nakiboğlu, Barış

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

74
views

32
downloads

A judicious application of the Berry-Esseen theorem via the concepts of Augustin information and mean is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega(n(-0.5(1-E'sp(R,W,p)))) for the constant composition codes. The resulting non-asymptotic bounds have definite approximation error terms.

Subject Keywords

Lower Bounds, Error, Probability

URI

https://hdl.handle.net/11511/40521

DOI

https://doi.org/10.1109/isit.2019.8849819

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A simple derivation of the refined sphere packing bound under certain symmetry hypotheses Nakiboğlu, Barış (2020-01-01) A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega (n(-0.5(1-E'sp)((R)))) for all codes on certain families of channels (including the Gaussian channels and the nonstationary Renyi symmetric channels) and for the constant composition codes on stationary memoryless channels. The resulting nonasymptotic bounds have definite approximation error terms. As a preliminar...
The Augustin center and the sphere packing bound for memoryless channels Nakiboğlu, Barış (2017-08-25) For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-llarremoes bound are established. Augustin-Legendre capacity, center, and radius are introduced and proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing bounds with polynomial prefactors are derived for codes on two families of channels: (possibly non-stationary) memoryless channels with multiple additive cost constraints and stationary memoryless c...
A local discontinuous Galerkin method for Dirichlet boundary control problems Yücel, Hamdullah (null; 2018-10-20) In this paper, we consider Dirichlet boundary control of a convection-diffusion equation with L 2 4 – 5 boundary controls subject to pointwise bounds on the control posed on a two dimensional convex polygonal domain. 6 We use the local discontinuous Galerkin method as a discretization method. We derive a priori error estimates for 7 the approximation of the Dirichlet boundary control problem on a polygonal domain. Several numerical results are 8 provided to illustrate the theoretical results.
A perturbative treatment for the bound states of the Hellmann potential Ikhdair, Sameer M.; Sever, Ramazan (Elsevier BV, 2007-05-14) A new approximation formalism is applied to study the bound states of the Hellmann potential, which represents the superposition of the attractive Coulomb potential -a/r and the Yukawa potential bexp(-delta r)/r of arbitrary strength h and screening parameter delta. Although the analytic expressions for the energy eigenvalues E(n,l) yield quite accurate results for a wide range of n, f in the limit of very weak screening, the results become gradually worse as the strength b and the screening coefficient 6 i...
A quasi inextensible element formulation for anisotropic continuum Dal, Hüsnü (2016-06-10) The contribution presents a novel finite element formulation for quasi-inextensible and quasi-incompressible finite hyperelastic behaviour of transeversely anisotropic materials and addresses its computational aspects. The formulation is presented in purely Eulerian setting and based on the additive decomposition of the free energy function into isotropic and anisotropic parts where the former is further decomposed into isochoric and volumetric parts. For the quasi-incompressible material response, the Q1P0...

Citation Formats

B. Nakiboğlu, “A Simple Derivation of the Refined SPB for the Constant Composition Codes,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40521.