Technical Program

Paper Detail

Paper Title A Recursive Cost-Constrained Construction that Attains the Expurgated Exponent
Paper IdentifierFR3.R8.2
Authors Anelia Somekh-Baruch, Bar-Ilan University, Israel; Jonathan Scarlett, National University of Singapore, Singapore; Albert Guillén i Fàbregas, ICREA & Universitat Pompeu Fabra, Spain and University of Cambridge, United Kingdom
Session Error Exponents II
Location Conseil, Level 5
Session Time Friday, 12 July, 14:30 - 16:10
Presentation Time Friday, 12 July, 14:50 - 15:10
Manuscript  Click here to download the manuscript
Abstract We show that a recursive cost-constrained random coding scheme attains an error exponent that is at least as high as both the random-coding exponent and the expurgated exponent. The random coding scheme enforces that every pair of codewords in the codebook meets a minimum distance condition, and is reminiscent of the Gilbert-Varshamov construction, but with the notable feature of permitting continuous-alphabet channels. The distance function is initially arbitrary, and it is shown that the Chernoff/Bhattacharrya distance suffices to attain the random coding and expurgated exponents.