An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity
Information Theory
2014-04-29 v2 Combinatorics
math.IT
Abstract
In this paper, we propose an upper bound on the minimum Bhattacharyya distance of codes for channels with a zero-error capacity. The bound is obtained by combining an extension of the Elias bound introduced by Blahut, with an extension of a bound previously introduced by the author, which builds upon ideas of Gallager, Lov\'asz and Marton.
Cite
@article{arxiv.1401.2398,
title = {An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity},
author = {Marco Dalai},
journal= {arXiv preprint arXiv:1401.2398},
year = {2014}
}
Comments
ISIT 2014