<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.</p></abstract>

This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.

Creation of Unequal Error Protection Codes for Two Groups of Symbols

Institute of Control and Computation Engineering, University of Zielona Góra, ul. Podgórna 50, Zielona Góra, Poland

International Journal of Applied Mathematics and Computer Science

{"article-title":"Creation of Unequal Error Protection Codes for Two Groups of Symbols"}

This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of...

Creation of Unequal Error Protection Codes for Two Groups of Symbols

Online veröffentlicht: 16. Juni 2008

Seitenbereich: 251 - 257

DOI: https://doi.org/10.2478/v10006-008-0023-x

Schlüsselwörter
unequal error protection codes (UEP codes), perfect codes, Hamming's upper bound, Hilbert's lower bound, generation matrix

This content is open access.

Creation of Unequal Error Protection Codes for Two Groups of Symbols

Online veröffentlicht: 16. Juni 2008

Seitenbereich: 251 - 257

DOI: https://doi.org/10.2478/v10006-008-0023-x

Schlüsselwörterunequal error protection codes (UEP codes), perfect codes, Hamming's upper bound, Hilbert's lower bound, generation matrix

This content is open access.

Schlüsselwörter
unequal error protection codes (UEP codes), perfect codes, Hamming's upper bound, Hilbert's lower bound, generation matrix