Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
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
12
views
16
downloads
Cite This
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
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
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.
