Publication: The Error Probability of Generalized Perfect Codes via the Meta-Converse
Loading...
Advisors
Tutors
Editor
Publication date
Defense date
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
publication.page.ispartofseries
To cite this item, use the following identifier: https://hdl.handle.net/10016/28842
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.
Note
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.