Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Baris Nakiboglu"'
Autor:
Mucahit Furkan Yildiz, Baris Nakiboglu
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f15d23ceb89138900b280a55b5e7efd2
https://doi.org/10.1109/isit50566.2022.9834875
https://doi.org/10.1109/isit50566.2022.9834875
Autor:
Baris Nakiboglu, Hao-Chung Cheng
Publikováno v:
ITW
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0658bb570ce42c5ff67dd7c896e1c0a
http://arxiv.org/abs/2109.00443
http://arxiv.org/abs/2109.00443
Autor:
Baris Nakiboglu
Publikováno v:
IEEE Transactions on Communications. 67:7456-7467
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d011741bb2fddf7c49bf3696c55c325
https://doi.org/10.1109/tcomm.2019.2931302
https://doi.org/10.1109/tcomm.2019.2931302
Autor:
Baris Nakiboglu
Publikováno v:
Problems of Information Transmission. 55:299-342
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6432db9046eb3d07b8d52bf9df7c7a94
https://doi.org/10.1134/s003294601904001x
https://doi.org/10.1134/s003294601904001x
Autor:
Baris Nakiboglu
Publikováno v:
IEEE Transactions on Information Theory. 65:841-860
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a43e00c70dfab9e7c5e3161c81356b7b
https://doi.org/10.1109/tit.2018.2861002
https://doi.org/10.1109/tit.2018.2861002
Autor:
Baris Nakiboglu
Publikováno v:
IEEE Transactions on Information Theory. 65:816-840
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0c12837d6d4f47cd851480fbe1be0f4
https://doi.org/10.1109/tit.2018.2882547
https://doi.org/10.1109/tit.2018.2882547
Autor:
Baris Nakiboglu, Hao-Chung Cheng
Publikováno v:
ISIT
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13075c80ddca77fbd211b797f8ad1571
Autor:
Baris Nakiboglu
Publikováno v:
ISIT
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 \left( {{n^{ - 0.5\left( {1 - E_{sp}^\prime
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e30e1fc6a9e4290ff4ab3eb132604ff6
https://doi.org/10.1109/isit.2019.8849819
https://doi.org/10.1109/isit.2019.8849819
Autor:
Baris Nakiboglu
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc617bc5dfe0cc8ce17bb54f57006f99
Autor:
Baris Nakiboglu
Publikováno v:
ISIT
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2a43861d8c161178527d8caec005566
https://doi.org/10.1109/isit.2017.8006759
https://doi.org/10.1109/isit.2017.8006759