A Quantitative Version of More Capable Channel Comparison

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Kougang-Yombi, Donald, Hązła, Jan
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909082892369920
author Kougang-Yombi, Donald
Hązła, Jan
author_facet Kougang-Yombi, Donald
Hązła, Jan
contents This paper introduces a quantitative generalization of the ``more capable'' comparison of broadcast channels, which is termed ``more capable with advantage''. Some basic properties are demonstrated (including tensorization on product channels), and a characterisation is given for the cases of Binary Symmetric Channel (BSC) and Binary Erasure Channel (BEC). It is then applied to two problems. First, a list decoding bound on the BSC is given that applies to transitive codes that achieve capacity on the BEC. Second, new lower bounds on entropy rates of binary hidden Markov processes are derived.
format Preprint
id arxiv_https___arxiv_org_abs_2401_14214
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Quantitative Version of More Capable Channel Comparison
Kougang-Yombi, Donald
Hązła, Jan
Information Theory
This paper introduces a quantitative generalization of the ``more capable'' comparison of broadcast channels, which is termed ``more capable with advantage''. Some basic properties are demonstrated (including tensorization on product channels), and a characterisation is given for the cases of Binary Symmetric Channel (BSC) and Binary Erasure Channel (BEC). It is then applied to two problems. First, a list decoding bound on the BSC is given that applies to transitive codes that achieve capacity on the BEC. Second, new lower bounds on entropy rates of binary hidden Markov processes are derived.
title A Quantitative Version of More Capable Channel Comparison
topic Information Theory
url https://arxiv.org/abs/2401.14214