- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Linear Programming Bound for Unequal Error Protection Codes (in Japanese) |
|---|---|
| Authors | Tomohiko Saito 、Yoshifumi Ukita 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2009 |
| Format | International Conference |
| Category | Channel coding |
| Jounal Name | Proceedings of the 2010 Australian Communications Theory Workshop |
| Jounal Page | pp.24-29, Canberra, Australia |
| Published Year | 2010 |
| Published Month | |
| Abstract （English） |
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. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
