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
Australia
Canberra, ACT
期間10/2/310/2/5

ASJC Scopus subject areas

  • Computer Networks and Communications

フィンガープリント A linear programming bound for unequal error protection codes' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Saito, T., Ukita, Y., Matsushima, T., & Hirasawa, S. (2010). A linear programming bound for unequal error protection codes. : 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