A linear programming bound for unequal error protection codes

Tomohiko Saito, Yoshifumi Ukita, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In coding theory, it is important to calculate an upper bound for the size of codes given the length and minimum distance. The Linear Programming (LP) bound is known as a good upper bound for the size of codes. On the other hand, Unequal Error Protection (UEP) codes have been studied in coding theory. In UEP codes, a codeword has special bits which are protected against a greater number of errors than other bits. In this paper, we propose a LP bound for UEP codes. Firstly, we generalize the distance distribution (or weight distribution) of codes. Under the generalization, we lead to the LP bound for UEP codes. And we show a numerical example of the LP bound for UEP codes. Lastly, we compare the proposed bound with a modified Hamming bound.

Original languageEnglish
Title of host publication2010 Australian Communications Theory Workshop, AusCTW 2010
Pages24-29
Number of pages6
DOIs
Publication statusPublished - 2010 Apr 30
Event2010 Australian Communications Theory Workshop, AusCTW 2010 - Canberra, ACT, Australia
Duration: 2010 Feb 32010 Feb 5

Publication series

Name2010 Australian Communications Theory Workshop, AusCTW 2010

Conference

Conference2010 Australian Communications Theory Workshop, AusCTW 2010
CountryAustralia
CityCanberra, ACT
Period10/2/310/2/5

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Saito, T., Ukita, Y., Matsushima, T., & Hirasawa, S. (2010). A linear programming bound for unequal error protection codes. In 2010 Australian Communications Theory Workshop, AusCTW 2010 (pp. 24-29). [5426756] (2010 Australian Communications Theory Workshop, AusCTW 2010). https://doi.org/10.1109/AUSCTW.2010.5426756