A linear programming bound for unequal error protection codes

Tomohiko Saito; Yoshifumi Ukita; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/AUSCTW.2010.5426756

A linear programming bound for unequal error protection codes

Tomohiko Saito^*, Yoshifumi Ukita, Toshiyasu Matsushima, Shigeichi Hirasawa

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	2010 Australian Communications Theory Workshop, AusCTW 2010
Pages	24-29
Number of pages	6
DOIs	https://doi.org/10.1109/AUSCTW.2010.5426756
Publication status	Published - 2010 Apr 30
Event	2010 Australian Communications Theory Workshop, AusCTW 2010 - Canberra, ACT, Australia Duration: 2010 Feb 3 → 2010 Feb 5

Publication series

Name	2010 Australian Communications Theory Workshop, AusCTW 2010

Conference

Conference	2010 Australian Communications Theory Workshop, AusCTW 2010
Country/Territory	Australia
City	Canberra, ACT
Period	10/2/3 → 10/2/5

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1109/AUSCTW.2010.5426756

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., 5426756, 2010 Australian Communications Theory Workshop, AusCTW 2010, pp. 24-29, 2010 Australian Communications Theory Workshop, AusCTW 2010, Canberra, ACT, Australia, 10/2/3. https://doi.org/10.1109/AUSCTW.2010.5426756

@inproceedings{8311e59059bd4db083a7fa66ef5a6f49,

title = "A linear programming bound for unequal error protection codes",

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.",

author = "Tomohiko Saito and Yoshifumi Ukita and Toshiyasu Matsushima and Shigeichi Hirasawa",

year = "2010",

month = apr,

day = "30",

doi = "10.1109/AUSCTW.2010.5426756",

language = "English",

isbn = "9781424454334",

series = "2010 Australian Communications Theory Workshop, AusCTW 2010",

pages = "24--29",

booktitle = "2010 Australian Communications Theory Workshop, AusCTW 2010",

note = "2010 Australian Communications Theory Workshop, AusCTW 2010 ; Conference date: 03-02-2010 Through 05-02-2010",

}

TY - GEN

T1 - A linear programming bound for unequal error protection codes

AU - Saito, Tomohiko

AU - Ukita, Yoshifumi

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2010/4/30

Y1 - 2010/4/30

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

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

UR - http://www.scopus.com/inward/record.url?scp=77951469053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951469053&partnerID=8YFLogxK

U2 - 10.1109/AUSCTW.2010.5426756

DO - 10.1109/AUSCTW.2010.5426756

M3 - Conference contribution

AN - SCOPUS:77951469053

SN - 9781424454334

T3 - 2010 Australian Communications Theory Workshop, AusCTW 2010

SP - 24

EP - 29

BT - 2010 Australian Communications Theory Workshop, AusCTW 2010

T2 - 2010 Australian Communications Theory Workshop, AusCTW 2010

Y2 - 3 February 2010 through 5 February 2010

ER -

A linear programming bound for unequal error protection codes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this