Barış Nakiboğlu

E-mail
bnakib@metu.edu.tr
Department
Department of Electrical and Electronics Engineering
Scopus Author ID
Web of Science Researcher ID
The Sphere Packing Bound for Memoryless Channels
Nakiboğlu, Barış (Pleiades Publishing Ltd, 2020-07-01)
Sphere packing bounds (SPBs)-with prefactors that are polynomial in the block length-are derived for codes on two families of memoryless channels using Augustin's method: (possibly nonstationary) memoryless channels with (...
Refined Strong Converse for the Constant Composition Codes
Cheng, Hao-Chung; Nakiboğlu, Barış (2020-06-01)
A strong converse bound for constant composition codes of the form P (n) e ≥ 1-An -0.5(1-E0sc(R,W,p))e-nEsc(R,W,p) is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mea...
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)))) fo...
The Sphere Packing Bound for DSPCs with Feedback à la Augustin
Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2019-11-01)
Establishing the sphere packing bound for block codes on the discrete stationary product channels with feedback—which are commonly called the discrete memoryless channels with feedback—was considered to be an open problem ...
The Augustin Capacity and Center
Nakiboğlu, Barış (Pleiades Publishing Ltd, 2019-10-01)
For any channel, the existence of a unique Augustin mean is established for any positive order and probability mass function on the input set. The Augustin mean is shown to be the unique fixed point of an operator defined ...
A Simple Derivation of the Refined SPB for the Constant Composition Codes
Nakiboğlu, Barış (2019-07-01)
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,...
The Sphere Packing Bound via Augustin's Method
Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2019-02-01)
A sphere packing bound (SPB) with a prefactor that is polynomial in the block length n is established for codes on a length n product channel W-[1,W- n], assuming that the maximum order 1/2 Renyi capacity among the compone...
The Renyi Capacity and Center
Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2019-02-01)
Renyi's information measures-the Renyi information, mean, capacity, radius, and center-are analyzed relying on the elementary properties of the Renyi divergence and the power means. The van Erven-Harremoes conjecture is pr...
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 int...
Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback
Nakiboğlu, Barış; Zheng, Lizhong; Coleman, Todd P (2013-03-01)
The bit-wise unequal error protection problem, for the case when the number of groups of bits is fixed, is considered for variable-length block codes with feedback. An encoding scheme based on fixed-length block codes with...
Citation Formats