A linear programming bound for unequal error protection codes

Tomohiko Saito, Yoshifumi Ukita, Toshiyasu Matsushima, Shigeichi Hirasawa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publication2010 Australian Communications Theory Workshop, AusCTW 2010
    Pages24-29
    Number of pages6
    DOIs
    Publication statusPublished - 2010
    Event2010 Australian Communications Theory Workshop, AusCTW 2010 - Canberra, ACT
    Duration: 2010 Feb 32010 Feb 5

    Other

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

    Fingerprint

    Linear programming

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Saito, T., Ukita, Y., Matsushima, T., & Hirasawa, S. (2010). A linear programming bound for unequal error protection codes. In 2010 Australian Communications Theory Workshop, AusCTW 2010 (pp. 24-29). [5426756] https://doi.org/10.1109/AUSCTW.2010.5426756

    A linear programming bound for unequal error protection codes. / Saito, Tomohiko; Ukita, Yoshifumi; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    2010 Australian Communications Theory Workshop, AusCTW 2010. 2010. p. 24-29 5426756.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Saito, T, Ukita, Y, Matsushima, T & Hirasawa, S 2010, A linear programming bound for unequal error protection codes. in 2010 Australian Communications Theory Workshop, AusCTW 2010., 5426756, pp. 24-29, 2010 Australian Communications Theory Workshop, AusCTW 2010, Canberra, ACT, 10/2/3. https://doi.org/10.1109/AUSCTW.2010.5426756
    Saito T, Ukita Y, Matsushima T, Hirasawa S. A linear programming bound for unequal error protection codes. In 2010 Australian Communications Theory Workshop, AusCTW 2010. 2010. p. 24-29. 5426756 https://doi.org/10.1109/AUSCTW.2010.5426756
    Saito, Tomohiko ; Ukita, Yoshifumi ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / A linear programming bound for unequal error protection codes. 2010 Australian Communications Theory Workshop, AusCTW 2010. 2010. pp. 24-29
    @inproceedings{8311e59059bd4db083a7fa66ef5a6f49,
    title = "A linear programming bound for unequal error protection codes",
    abstract = "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.",
    author = "Tomohiko Saito and Yoshifumi Ukita and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "2010",
    doi = "10.1109/AUSCTW.2010.5426756",
    language = "English",
    isbn = "9781424454334",
    pages = "24--29",
    booktitle = "2010 Australian Communications Theory Workshop, AusCTW 2010",

    }

    TY - GEN

    T1 - A linear programming bound for unequal error protection codes

    AU - Saito, Tomohiko

    AU - Ukita, Yoshifumi

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 2010

    Y1 - 2010

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=77951469053&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77951469053&partnerID=8YFLogxK

    U2 - 10.1109/AUSCTW.2010.5426756

    DO - 10.1109/AUSCTW.2010.5426756

    M3 - Conference contribution

    AN - SCOPUS:77951469053

    SN - 9781424454334

    SP - 24

    EP - 29

    BT - 2010 Australian Communications Theory Workshop, AusCTW 2010

    ER -