e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication
Artículo científico (JournalArticle)
The Error Probability of Generalized Perfect Codes via the Meta-Converse
We introduce a definition of perfect and quasi-perfect codes for discrete symmetric channels based on the packing and covering properties of generalized spheres whose shape is tilted using an auxiliary probability measure. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to coincide with the estimate provided by the meta-converse lower bound. We illustrate how the proposed definition naturally extends to cover almost-lossless source-channel coding and lossy compression., This work was supported in part by the European Research Council (ERC) under Grant 714161 and Grant 725411, in part by the Spanish Ministry of Economy and Corupetitiveness under Grant TEC2016-78434-C3 and Grant DCI-2015-27020, in part by the National Science Foundation under Grant CCF-1513915, in part by the Center for Science of Information, and in part by tbe NSF Science and Technology Center under Grant CCF-0939370.
Project:
EC / H2020 714161
,
EC / H2020 725411