Creation of unequal error protection codes for two groups of symbols

Eugeniusz Kuriata

International Journal of Applied Mathematics and Computer Science (2008)

  • Volume: 18, Issue: 2, page 251-257
  • ISSN: 1641-876X

Abstract

top
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.

How to cite

top

Eugeniusz Kuriata. "Creation of unequal error protection codes for two groups of symbols." International Journal of Applied Mathematics and Computer Science 18.2 (2008): 251-257. <http://eudml.org/doc/207882>.

@article{EugeniuszKuriata2008,
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.},
author = {Eugeniusz Kuriata},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {unequal error protection codes (UEP codes); perfect codes; Hamming's upper bound; Hilbert’s lower bound; generation matrix; Hamming upper bound; Hilbert lower bound},
language = {eng},
number = {2},
pages = {251-257},
title = {Creation of unequal error protection codes for two groups of symbols},
url = {http://eudml.org/doc/207882},
volume = {18},
year = {2008},
}

TY - JOUR
AU - Eugeniusz Kuriata
TI - Creation of unequal error protection codes for two groups of symbols
JO - International Journal of Applied Mathematics and Computer Science
PY - 2008
VL - 18
IS - 2
SP - 251
EP - 257
AB - 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.
LA - eng
KW - unequal error protection codes (UEP codes); perfect codes; Hamming's upper bound; Hilbert’s lower bound; generation matrix; Hamming upper bound; Hilbert lower bound
UR - http://eudml.org/doc/207882
ER -

References

top
  1. Boyarinov I.M. (1980). Constructing linear unequal error protection codes, Problemy Peredachi Informatsii 16(2): 103- 107, (in Russian). Zbl0468.94011
  2. Boyarinov I.M and Katsman G.L. (1981). Linear unequal error protection codes, IEEE Transactions on Information Theory IT-27(2): 168-175. Zbl0458.94042
  3. Englund E.K. and Hansson A.I. (1997). Constructive codes with unequal error protection, IEEE Transactions on Information Theory 43(2): 715-721. Zbl0870.94047
  4. Kacman G. L. (1980). Bounds on volume of linear codes with unequal information symbol protection, Problemy Peredachi Informatsii 16(2): 99-105, (in Russian). 
  5. Kower T. M. (1974). Broadband Information Charnels, Mir, Moscow, (in Russian). 
  6. Kuriata E. (1982). Investigation and Synthesis Principles of Channel Creation for Dispatcher Centralization Systems, Ph.D. thesis, Moscow State University of Railway Engineering, MIIT, (in Russian). 
  7. MacWilliams F. J. and Sloane N. J. A. (1977). The Theory of Error-Correcting Codes, North-Holland, Amsterdam. Zbl0369.94008
  8. Masnik B. and Wolf J. (1967). On linear unequal error protection codes, IEEE Transactions on Information Theory, IT13(4): 600-607. Zbl0156.40702

NotesEmbed ?

top

You must be logged in to post comments.