An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity

2014/01/10 by Marco Dalai, Dalai, Marco
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT

paper · pdf · doi:10.48550/arxiv.1401.2398

ISIT 2014

arxiv created 2014/04/28 · arxiv updated 2014/04/29

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ász and Marton.

Related

• On the Maximum Size of Block Codes Subject to a Distance Criterion
• An improvement of the asymptotic Elias bound for non-binary codes
• Simple Channel Coding Bounds
• Code size constraints in b-symbol read channels: A bound analysis
• Decoding Cyclic Codes up to a New Bound on the Minimum Distance