Publication:
The Error Probability of Generalized Perfect Codes via the Meta-Converse

Loading...
Thumbnail Image
Identifiers
Publication date
2019-09
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
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.
Description
Keywords
Shannon theory, Perfect codes, Quasi-perfect codes, Maximum likelihood decoding, Finite blocklength analysis, Meta-converse, Hypothesis testing, Channel coding, Joint source-channel coding, Rate distortion theory
Bibliographic citation
Vazquez-Vilar, G., Guillén i Fàbregas, A. y Verdú, S. (2019). The Error Probability of Generalized Perfect Codes via the Meta-Converse. IEEE Transactions on Information Theory, 65(9), pp. 5705-5717.