| タイトル | A Linear Programming Bound for Unequal Error Protection Codes |
|---|---|
| 著者 | 斉藤友彦 、浮田善文 、松嶋敏泰 、平澤茂一 |
| 年度 | 2009 |
| 形式 | 国際学会 |
| 分野 | 通信路符号化 |
| 掲載雑誌名 | Proceedings of the 2010 Australian Communications Theory Workshop |
| 掲載号・ページ | pp.24-29, Canberra, Australia |
| 掲載年 | 2010 |
| 掲載月 | |
| アブスト （日本語） |
学会名：2010 Australian Communications Theory Workshop (AusCTW 2010) 日程：2-5 February 2010 場所：Canberra, Australia |
| アブスト （英語） |
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. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
