A linear programming bound for unequal error protection codes

Tomohiko Saito, Yoshifumi Ukita, Toshiyasu Matsushima, Shigeichi Hirasawa

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2010 Australian Communications Theory Workshop, AusCTW 2010
ページ24-29
ページ数6
DOI
出版ステータスPublished - 2010 4 30
イベント2010 Australian Communications Theory Workshop, AusCTW 2010 - Canberra, ACT, Australia
継続期間: 2010 2 32010 2 5

出版物シリーズ

名前2010 Australian Communications Theory Workshop, AusCTW 2010

Conference

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

ASJC Scopus subject areas

  • Computer Networks and Communications

フィンガープリント 「A linear programming bound for unequal error protection codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル