The Error Probability of Generalized Perfect Codes via the Meta-Converse
From MaRDI portal
Publication:5211399
DOI10.1109/TIT.2019.2906227zbMATH Open1432.94065arXiv1805.10025WikidataQ128208979 ScholiaQ128208979MaRDI QIDQ5211399FDOQ5211399
Authors: Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Sergio Verdú 
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. 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.
Full work available at URL: https://arxiv.org/abs/1805.10025
This page was built for publication: The Error Probability of Generalized Perfect Codes via the Meta-Converse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211399)
