Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Nakiboglu, Baris"'
Autor:
Nakiboğlu, Barış, Cheng, Hao-Chung
The mutual information is bounded from above by a decreasing affine function of the square of the distance between the input distribution and the set of all capacity-achieving input distributions $\Pi_{\mathcal{A}}$, on small enough neighborhoods of
Externí odkaz:
http://arxiv.org/abs/2304.14219
Autor:
Cheng, Hao-Chung, Nakiboglu, Baris
The existence of a unique Augustin mean and its invariance under the Augustin operator are established for arbitrary input distributions with finite Augustin information for channels with countably generated output $\sigma$-algebras. The existence is
Externí odkaz:
http://arxiv.org/abs/2109.00443
Autor:
Cheng, Hao-Chung, Nakiboglu, Baris
A strong converse bound for constant composition codes of the form $P_{e}^{(n)} \geq 1- A n^{-0.5(1-E_{sc}'(R,W,p))} e^{-n E_{sc}(R,W,p)}$ is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, w
Externí odkaz:
http://arxiv.org/abs/2002.11414
Autor:
Nakiboglu, Baris
Publikováno v:
Turkish Journal of Mathematics, 44(3):919-948, May 2020
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 $\mathit{\Omega}\left(n^{-0.5(1-E_{sp}'(R))}\right)$ for al
Externí odkaz:
http://arxiv.org/abs/1904.12780
Autor:
Nakiboglu, Baris
Publikováno v:
IEEE Transactions on Communications, 67(11):7456-7467, Nov. 2019
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 until recently, notwit
Externí odkaz:
http://arxiv.org/abs/1806.11531
Autor:
Nakiboglu, Baris
Publikováno v:
Problems of Information Transmission, 56 (3):201-244, 2020
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 non-stationary) memoryless channels with (possibly multiple) ad
Externí odkaz:
http://arxiv.org/abs/1804.06372
Autor:
Nakiboglu, Baris
Publikováno v:
Problems of Information Transmission, 55 (4):299-342, Oct 2019
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 in terms of the order and th
Externí odkaz:
http://arxiv.org/abs/1803.07937
Autor:
Nakiboğlu, Barış
For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. Augustin-Legendre capacity, center, and radius are introduced and proved to be equa
Externí odkaz:
http://arxiv.org/abs/1701.06610
Autor:
Nakiboglu, Baris
Publikováno v:
IEEE Transactions on Information Theory, 65(2):816-840, Feb. 2019
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,n]}$ assuming that the maximum order $1/2$ Renyi capacity among the component channels, i.e. $\ma
Externí odkaz:
http://arxiv.org/abs/1611.06924
Autor:
Nakiboglu, Baris
Publikováno v:
IEEE Transactions on Information Theory, 65(2):841-860, Feb 2019
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 proved for any positive
Externí odkaz:
http://arxiv.org/abs/1608.02424