Name
Abstract | ||
|---|---|---|
In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/SMC.2018.00496 | 2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC) |
Field | DocType | ISSN |
Discrete mathematics,Hamming code,Code size,Control theory,Computer science,Upper and lower bounds,Coding theory,Linear programming,Code (cryptography) | Conference | 1062-922X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomohiko Saito | 1 | 9 | 3.66 |
| Toshiyasu Matsushima | 2 | 97 | 32.76 |
| Shigeichi Hirasawa | 3 | 322 | 150.91 |