Citation:
Vazquez- Vilar, G., Guillén i Fàbregas, A. y Verdú, S. (2018). The Error Probability of Generalized Perfect Codes. In 2018 IEEE International Symposium on Information Theory (ISIT).
xmlui.dri2xhtml.METS-1.0.item-contributor-funder:
European Commission Ministerio de Economía y Competitividad (España)
Sponsor:
This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under Grants TEC2016-78434-C3 and IJCI-2015-27020, by
the National Science Foundation under Grant CCF-1513915 and by the Center for Science of Information, an NSF Science and Technology Center under Grant CCF-0939370.
Project:
info:eu-repo/grantAgreement/ERC/H2020/714161 info:eu-repo/grantAgreement/ERC/H2020/725411 Gobierno de España. TEC2016-78434-C3 Gobierno de España. IJCI-2015-27020
We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This new definition generalizes previous definitions and encompasses maximum distance separable codes. The error probability oWe introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This new definition generalizes previous definitions and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to attain the meta-converse lower bound.[+][-]
Description:
This paper has been presented at : IEEE International Symposium on Information Theory 2018