@inproceedings{de83420a0beb44d0a76f8182487c32d9,
title = "Greedy-merge degrading has optimal power-law",
abstract = "Consider a channel with a given input distribution. Our aim is to degrade it to a channel with at most L output letters. One such degradation method is the so called 'greedy-merge' algorithm. We derive an upper bound on the reduction in mutual information between input and output. For fixed input alphabet size and variable L, the upper bound is within a constant factor of an algorithm-independent lower bound. Thus, we establish that greedy-merge is optimal in the power-law sense.",
author = "Assaf Kartowsky and Ido Tal",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "https://doi.org/10.1109/ISIT.2017.8006803",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "1618--1622",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
}