Saddlepoint approximations of lower and upper bounds to the error probability in channel coding
Lists
Only you see this
Abstract
Saddlepoint approximations of the meta-converse and random-coding union bounds are derived. These bounds accurately characterize the channel coding minimum error probability for symmetric memoryless channels in a wide range of system parameters. The proposed approximations are simple to compute and yield a unified analysis of both hypothesis-testing lower bounds and random-coding upper bounds.
BibTeX
@inproceedings{fontsegura2018saddlepoint,
author = {Josep Font-Segura and Gonzalo Vazquez-Vilar and Alfonso Martinez and Albert Guillen i Fabregas and Alejandro Lancho},
title = {{Saddlepoint approximations of lower and upper bounds to the error probability in channel coding}},
booktitle = {CISS},
year = {2018},
doi = {10.1109/ciss.2018.8362304},
}Loading related content...