activity
20072019
most citedMinimax Rényi Redundancy

7 citations · 14 across the 9 of their papers we have counts for

collaborators
Showing cs.ITShow all

11 papers · 1 filter

cs.IT2019

A New Method for Employing Feedback to Improve Coding Performance

Aaron B. Wagner, Nirmal V. Shende, Yücel Altuğ

We introduce a novel mechanism, called timid/bold coding, by which feedback can be used to improve coding performance. For a certain class of DMCs, called compound-dispersion chann…

cs.IT2019

On exact asymptotics of the error probability in channel coding: symmetric channels

Yücel Altuğ, Aaron B. Wagner

The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryles…

cs.IT2017★ 7 cited

Minimax Rényi Redundancy

Semih Yagli, Yücel Altuğ, Sergio Verdú

The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax Rényi divergence, which is shown to be equal to…

cs.IT2013

Refinement of the random coding bound

Yucel Altug, Aaron B. Wagner

An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not…

cs.IT2013

The third-order term in the normal approximation for singular channels

Yucel Altug, Aaron B. Wagner

For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This…

cs.IT2012★ 2 cited

Refinement of the Sphere-Packing Bound: Asymmetric Channels

Yucel Altug, Aaron B. Wagner

We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the pre-factor in front of the exponen…