activity
20062026
most citedVariations on a theme by Schalkwijk and Kailath

107 citations · 395 across the 15 of their papers we have counts for

collaborators

15 papers

cs.IT2026

A Spectral Representation Of The Simple Hypothesis Testing Problem

Barış Nakiboğlu

The minimum Type II error probability (or volume) of simple hypothesis tests with randomized detectors is expressed as a Riemann integral of the (cumulative) distribution function…

cs.IT2021★ 6 cited

On the Existence of the Augustin Mean

Hao-Chung Cheng, Baris Nakiboglu

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 channe…

cs.IT2020★ 11 cited

Refined Strong Converse for the Constant Composition Codes

Hao-Chung Cheng, Baris Nakiboglu

A strong converse bound for constant composition codes of the form is established using the Berry-Esseen the…

cs.IT2019★ 8 cited

A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses

Baris Nakiboglu

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 prefact…

cs.IT2018★ 3 cited

The Sphere Packing Bound for DSPCs with Feedback a la Augustin

Baris Nakiboglu

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 f…

cs.IT2018★ 16 cited

The Sphere Packing Bound For Memoryless Channels

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: (po…

cs.IT2018★ 23 cited

The Augustin Capacity and Center

Baris Nakiboglu

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…

cs.IT2016★ 12 cited

The Sphere Packing Bound via Augustin's Method

Baris Nakiboglu

A sphere packing bound (SPB) with a prefactor that is polynomial in the block length is established for codes on a length product channel assuming that the maxi…

cs.IT2016★ 31 cited

The Renyi Capacity and Center

Baris Nakiboglu

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…

cs.IT2011★ 5 cited

Bit-wise Unequal Error Protection for Variable Length Block Codes with Feedback

Baris Nakiboglu, Siva K. Gorantla, Lizhong Zheng +1

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 encod…

cs.IT2009★ 20 cited

Error-and-Erasure Decoding for Block Codes with Feedback

Baris Nakiboglu, Lizhong Zheng

Inner and outer bounds are derived on the optimal performance of fixed length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First an i…

cs.IT2008★ 107 cited

Variations on a theme by Schalkwijk and Kailath

Robert G. Gallager, Baris Nakiboglu

Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian channels with ideal feedback for which the probability of decoding error decreases as a second-order exp…

cs.IT2008★ 78 cited

Unequal Error Protection: An Information Theoretic Perspective

Shashi Borade, Baris Nakiboglu, Lizhong Zheng

An information theoretic framework for unequal error protection is developed in terms of the exponential error bounds. The fundamental difference between the bit-wise and message-w…

cs.IT2006★ 17 cited

Error Exponents for Variable-length Block Codes with Feedback and Cost Constraints

B. Nakiboglu, R. G. Gallager

Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum…

cs.IT2006★ 58 cited

A Simple Converse of Burnashev's Reliability

Peter Berlin, Baris Nakiboglu, Bixio Rimoldi +1

In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels with feedback. Subsequently,…